ON PEDIGREE POLYTOPE AND ITS PROPERTIES

The fact that linear optimization over a polytope can be done in polynomial time in the input size of the instance, has created renewed interest in studying 0-1 polytopes corresponding to combinatorial optimization problems. Studying their polyhedral structure has resulted in new algorithms to solv...

Full description

Bibliographic Details
Main Author: Tiru S. Arthanari
Format: Article
Language:English
Published: Accademia Peloritana dei Pericolanti 2013-07-01
Series:Atti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali
Subjects:
Online Access:http://dx.doi.org/10.1478/AAPP.91S2A3