A polyhedral approach for a constrained quadratic 0–1 problem

In this paper we consider the problem of optimizing a quadratic pseudo-Boolean function subject to the cardinality constraint ∑ 1 ⩽ i ⩽ n x i = k with a polyhedral method. More precisely we propose a study of the convex hull of feasible points included in the Padberg's Boolean quadric polytope...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete Applied Mathematics Jg. 149; H. 1; S. 87 - 100
Hauptverfasser: Faye, Alain, Trinh, Quoc-an
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.08.2005
Elsevier
Schlagworte:
Computational Complexity
Computer Science
Constrained quadratic 0–1 problem
Faces
Facets
Polytope
Constrained quadratic 0–1 problem
Polytope
Facets
Faces
ISSN:0166-218X, 1872-6771
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper we consider the problem of optimizing a quadratic pseudo-Boolean function subject to the cardinality constraint ∑ 1 ⩽ i ⩽ n x i = k with a polyhedral method. More precisely we propose a study of the convex hull of feasible points included in the Padberg's Boolean quadric polytope and satisfying the cardinality constraint. Specifically, we investigate the connection with the Boolean quadric polytope and study a facet family. The relationship with two other polytopes of the literature is also explored.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2004.02.020