Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines.
Adam KurpiszMonaldo MastrolilliClaire MathieuTobias MömkeVictor VerdugoAndreas WiesePublished in: IPCO (2016)
Keyphrases
- identical machines
- semidefinite
- linear programming
- semidefinite programming
- interior point methods
- processing times
- linear programming relaxation
- scheduling problem
- single machine
- linear program
- extreme points
- lp relaxation
- primal dual
- np hard
- integer programming
- feasible solution
- mixed integer
- dynamic programming
- column generation
- polynomial time approximation
- linear systems
- quadratic programming
- precedence constraints
- optimal solution
- sufficient conditions
- objective function
- setup times
- integer program
- convex relaxation
- convex sets
- genetic algorithm
- higher dimensional