Computation of the Lasserre Ranks of Some Polytopes

Computation of the Lasserre Ranks of Some Polytopes

Over the years, various lift-and-project methods have been proposed to construct hierarchies of successive linear or semidefinite relaxations of a 0–1 polytope P n that converge to P in n steps. Many such methods have been shown to require n steps in the worst case. In this paper, we show that the m...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematics of operations research 2007-02, Vol.32 (1), p.88-94
1. Verfasser: Cheung, Kevin K. H
Format: Artikel
Sprache:eng
Schlagworte:
0-1 polytope
Combinatorial optimization
Computer software
Hierarchies
Integer programming
Integers
Lasserre rank
lift and project
Mathematical theorems
Mathematical vectors
Operations research
Polyhedrons
Polynomials
Polytopes
semidefinite relaxation
Studies
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Over the years, various lift-and-project methods have been proposed to construct hierarchies of successive linear or semidefinite relaxations of a 0–1 polytope P n that converge to P in n steps. Many such methods have been shown to require n steps in the worst case. In this paper, we show that the method of Lasserre also requires n steps in the worst case.
ISSN:0364-765X
1526-5471
DOI:10.1287/moor.1060.0212