Tight complexity lower bounds for integer linear programming with few constraints.
Dusan KnopMichal PilipczukMarcin WrochnaPublished in: CoRR (2018)
Keyphrases
- lower bound
- integer linear programming
- worst case
- linear inequalities
- upper bound
- global constraints
- cutting plane
- pseudo boolean
- column generation
- branch and bound
- lower and upper bounds
- bicriteria
- branch and bound algorithm
- boolean satisfiability
- average case complexity
- optimal solution
- symmetry breaking
- np hard
- integer program
- space complexity
- mixed integer
- boolean optimization
- constrained optimization
- linear programming
- objective function
- constraint programming
- computational complexity
- vc dimension
- combinatorial problems
- reinforcement learning
- decision problems
- constraint satisfaction
- heuristic search
- evolutionary algorithm