Fine-grained complexity of integer programming: The case of bounded branch-width and rank.
Fedor V. FominFahad PanolanM. S. RamanujanSaket SaurabhPublished in: CoRR (2016)
Keyphrases
- fine grained
- integer programming
- coarse grained
- np hard
- linear programming
- constraint programming
- production planning
- ai planning
- access control
- tightly coupled
- worst case
- network flow
- inference problems
- cutting plane
- vehicle routing problem with time windows
- lagrangian relaxation
- set covering
- computational complexity
- column generation
- cutting plane algorithm
- set partitioning
- data lineage
- integer program
- search algorithm
- set covering problem