Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming.
Timothy F. N. ChanJacob W. CooperMartin KouteckýDaniel KrálKristýna PekárkováPublished in: SIAM J. Comput. (2022)
Keyphrases
- integer programming
- dynamic programming
- np hard
- optimal solution
- linear programming
- worst case
- tree structure
- search space
- computational complexity
- learning algorithm
- transportation problem
- network flow
- benchmark problems
- vehicle routing problem with time windows
- optimization algorithm
- primal dual
- lagrangian relaxation
- column generation
- set covering
- qos multicast routing