Tightening simple mixed-integer sets with guaranteed bounds (Q431027): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10107-010-0435-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2167525805 / rank | |||
Normal rank | |||
Revision as of 22:21, 19 March 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
