Tightening simple mixed-integer sets with guaranteed bounds

In this paper we study how to reformulate knapsack sets and simple mixed integer sets in order to obtain provably tight, polynomially large formulations.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Mathematical programming 2012-06, Vol.133 (1-2), p.337-363
Hauptverfasser:	Bienstock, Daniel, McClosky, Benjamin
Format:	Artikel
Sprache:	eng
Schlagworte:	Analysis Applied sciences Approximation Calculus of Variations and Optimal Control Optimization Combinatorics Exact sciences and technology Flows in networks. Combinatorial problems Full Length Paper Knapsack problem Linear programming Mathematical analysis Mathematical and Computational Physics Mathematical Methods in Physics Mathematical programming Mathematics Mathematics and Statistics Mathematics of Computing Mixed integer Numerical Analysis Operational research and scientific management Operational research. Management science Optimization Optimization algorithms Studies Theoretical Tightening
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	In this paper we study how to reformulate knapsack sets and simple mixed integer sets in order to obtain provably tight, polynomially large formulations.
ISSN:	0025-5610 1436-4646
DOI:	10.1007/s10107-010-0435-x