Valid inequalities for quadratic optimisation with domain constraints.
Laura GalliAdam N. LetchfordPublished in: Discret. Optim. (2021)
Keyphrases
- valid inequalities
- mixed integer
- integer programming
- lower and upper bounds
- traveling salesman problem
- mixed integer programming
- linear programming
- cutting plane
- mixed integer program
- convex hull
- mixed integer linear programs
- column generation
- linear programming relaxation
- integer program
- feasible solution
- linear program
- cutting plane algorithm
- primal dual
- continuous variables
- network design problem
- lower bound
- genetic algorithm
- lagrangian relaxation
- production planning
- np hard
- cost function
- search algorithm