Matrices of Optimal Tree-Depth and Row-Invariant Parameterized Algorithm for Integer Programming.
Timothy F. N. ChanJacob W. CooperMartin KouteckýDaniel Král'Kristýna PekárkováPublished in: ICALP (2020)
Keyphrases
- integer programming
- np hard
- dynamic programming
- worst case
- linear programming
- optimal solution
- cutting plane
- tree structure
- transportation problem
- convergence rate
- set covering
- lagrangian relaxation
- knapsack problem
- objective function
- computational complexity
- set covering problem
- cutting plane algorithm
- network flow
- combinatorial optimization
- optimization algorithm
- np complete
- search space