Strengthening convex relaxations of 0/1-sets using Boolean formulas

In convex integer programming, various procedures have been developed to strengthen convex relaxations of sets of integer points. On the one hand, there exist several general-purpose methods that strengthen relaxations without specific knowledge of the set S of feasible integer points, such as popul...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical programming Jg. 190; H. 1-2; S. 467 - 482
Hauptverfasser: Fiorini, Samuel, Huynh, Tony, Weltge, Stefan
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2021
Springer Nature B.V
Schlagworte:
Boolean
Boolean algebra
Calculus of Variations and Optimal Control; Optimization
Combinatorial analysis
Combinatorics
Full Length Paper
Hierarchies
Integer programming
Linear programming
Mathematical and Computational Physics
Mathematical Methods in Physics
Mathematics
Mathematics and Statistics
Mathematics of Computing
Numerical Analysis
Optimization
Theoretical
90Cxx
68Q06
52Bxx
ISSN:0025-5610, 1436-4646
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In convex integer programming, various procedures have been developed to strengthen convex relaxations of sets of integer points. On the one hand, there exist several general-purpose methods that strengthen relaxations without specific knowledge of the set S of feasible integer points, such as popular linear programming or semi-definite programming hierarchies. On the other hand, various methods have been designed for obtaining strengthened relaxations for very specific sets S that arise in combinatorial optimization. We propose a new efficient method that interpolates between these two approaches. Our procedure strengthens any convex set containing a set S ⊆ { 0 , 1 } n by exploiting certain additional information about S . Namely, the required extra information will be in the form of a Boolean formula ϕ defining the target set S . The new relaxation is obtained by “feeding” the convex set into the formula ϕ . We analyze various aspects regarding the strength of our procedure. As one application, interpreting an iterated application of our procedure as a hierarchy, our findings simplify, improve, and extend previous results by Bienstock and Zuckerberg on covering problems.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0025-5610
1436-4646
DOI:10.1007/s10107-020-01542-w