Integer programming in parameterized complexity: Five miniatures.
Tomas GavenciakMartin KouteckýDusan KnopPublished in: Discret. Optim. (2022)
Keyphrases
- integer programming
- parameterized complexity
- global constraints
- fixed parameter tractable
- np hard
- constraint programming
- symmetry breaking
- linear programming
- cutting plane
- column generation
- computational problems
- integer program
- cutting plane algorithm
- bounded treewidth
- constraint satisfaction
- optimal solution
- constraint satisfaction problems
- combinatorial problems
- upper bound
- state space
- dynamic programming
- search algorithm