A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs.
Juan Pablo VielmaShabbir AhmedGeorge L. NemhauserPublished in: INFORMS J. Comput. (2008)
Keyphrases
- branch and bound algorithm
- quadratic program
- mixed integer
- linear programming
- optimal solution
- linear program
- np hard
- feasible solution
- branch and bound
- lower bound
- mixed integer linear programming
- objective function
- lagrangian relaxation
- upper bound
- mixed integer programming
- column generation
- cutting plane
- quadratic programming
- valid inequalities
- primal dual
- scheduling problem
- knapsack problem
- network design problem
- approximation algorithms
- integer programming
- metaheuristic
- search space
- convex hull
- graphical models
- worst case
- message passing
- special case
- integer variables
- dynamic programming
- search algorithm
- continuous variables
- hyperplane
- particle swarm optimization
- lp relaxation
- genetic algorithm
- neural network