Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems.
Yunpeng PanZhe LiangPublished in: Ann. Oper. Res. (2017)
Keyphrases
- scheduling problem
- min sum
- np hard
- lower bound
- min cut
- convex relaxation
- special case
- linear programming
- optimal solution
- lp relaxation
- integer programming
- approximation algorithms
- computational complexity
- tabu search
- linear program
- semidefinite
- constraint satisfaction problems
- knapsack problem
- convex optimization
- information theoretic
- minimum cost
- quadratic programming
- integer program
- goal programming
- pairwise
- shape matching
- primal dual
- semidefinite programming
- graph cuts