Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem.
Margaux NattafMarkó HorváthTamás KisChristian ArtiguesPierre LopezPublished in: Discret. Appl. Math. (2019)
Keyphrases
- valid inequalities
- scheduling problem
- convex hull
- integer programming
- continuous variables
- np hard
- feasible solution
- tabu search
- linear programming
- traveling salesman problem
- cutting plane algorithm
- mixed integer programming
- mixed integer linear programs
- mixed integer
- cutting plane
- column generation
- lower and upper bounds
- linear programming relaxation
- vehicle routing problem with time windows
- network design problem
- integer programming formulation
- integer program
- facet defining
- lagrangian relaxation
- primal dual
- energy minimization
- training set
- lower bound
- optimal solution
- constraint programming
- training samples
- graphical models
- cost function
- evolutionary algorithm
- facet defining inequalities
- objective function