New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines.
Sebastian BerndtHauke BrinkopKlaus JansenMatthias MnichTobias StammPublished in: CoRR (2023)
Keyphrases
- integer programming
- lagrangian relaxation
- np hard
- cutting plane
- production planning
- lower bound
- constraint programming
- linear programming
- upper bound
- column generation
- integer program
- graphical models
- single machine
- parallel machines
- scheduling problem
- packing problem
- special case
- computational complexity
- valid inequalities
- makespan minimization