A column generation approach for the unconstrained binary quadratic programming problem.
Geraldo R. MauriLuiz Antonio Nogueira LorenaPublished in: Eur. J. Oper. Res. (2012)
Keyphrases
- column generation
- linear programming
- branch and bound
- integer linear programming
- integer programming
- integer program
- linear program
- constraint programming
- lagrangean relaxation
- exact solution
- vehicle routing
- lagrangian relaxation
- optimal solution
- mixed integer programming
- set partitioning
- cutting plane
- cutting plane algorithm
- linear programming problems
- vehicle routing problem with time windows
- trust region
- dantzig wolfe decomposition
- valid inequalities
- linear programming relaxation
- lower bound
- set covering
- neural network
- multi objective
- search space
- search algorithm