1996 | OriginalPaper | Buchkapitel
Quadratic Assignment Polytopes
verfasst von : Manfred Padberg, Minendra P. Rijal
Erschienen in: Location, Scheduling, Design and Integer Programming
Verlag: Springer US
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this chapter we present various results and partial results on the facial structure of the quadratic assignment polytope QAP n and its symmetric relative, the polytope SQP n . We address primarily the questions of finding the affine hull and the dimension of the respective polytopes, but give also some valid inequalities for QAP n . Some of these problems are left open and suggested in the form of conjectures for future work on this difficult, but interesting class of combinatorial optimization problems.