Scheduling with conflicts: formulations, valid inequalities, and computational experiments.
Phablo F. S. MouraRoel LeusHande YamanPublished in: CoRR (2023)
Keyphrases
- valid inequalities
- cutting plane
- integer programming formulation
- integer programming
- traveling salesman problem
- cutting plane algorithm
- mixed integer
- feasible solution
- linear programming
- mixed integer programming
- lower and upper bounds
- mixed integer linear programs
- convex hull
- column generation
- randomly generated problems
- linear programming relaxation
- lower bound
- integer program
- primal dual
- production planning
- network design problem
- knapsack problem
- lagrangian relaxation
- scheduling problem
- mixed integer program
- objective function
- np hard
- branch and bound
- resource allocation
- randomly generated
- continuous variables
- ant colony optimization
- linear program
- dynamic programming