Tightening simple mixed-integer sets with guaranteed bounds (Q431027): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q163023 |
Changed an Item |
||
| Property / author | |||
| Property / author: Bienstock, Daniel / rank | |||
Normal rank | |||
Revision as of 22:33, 9 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tightening simple mixed-integer sets with guaranteed bounds |
scientific article |
Statements
Tightening simple mixed-integer sets with guaranteed bounds (English)
0 references
26 June 2012
0 references
This paper shows that using combinatorial disjunctions, that depend on the problem structure, leads to tight, polynomially large formulations for 0/1 knapsack sets and some fixed-charge network flow sets.
0 references
combinatorial optimization
0 references
extended formulations
0 references
approximation algorithms
0 references
