A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine.
Fabián A. ChudakDorit S. HochbaumPublished in: Oper. Res. Lett. (1999)
Keyphrases
- linear programming relaxation
- knapsack problem
- linear programming
- lower bound
- integer solution
- branch and bound
- mixed integer programming
- column generation
- integer programming
- feasible solution
- scheduling problem
- integrality gap
- valid inequalities
- production planning
- integer program
- constraint programming
- search algorithm
- primal dual
- genetic algorithm
- cutting plane
- np hard
- traveling salesman problem
- combinatorial optimization
- resource allocation