On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming.
Andreas S. SchulzPublished in: Bonn Workshop of Combinatorial Optimization (2008)
Keyphrases
- integer programming
- inference problems
- lagrangian relaxation
- np hard
- decision problems
- computational complexity
- linear programming
- set covering problem
- cutting plane
- integer program
- set covering
- column generation
- problems involving
- integer programming formulations
- transportation problem
- production planning
- search methods
- network flow
- constraint programming
- exact methods
- combinatorial optimization
- cutting plane algorithm
- set partitioning
- optimization problems