AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems.
Radu MarinescuRina DechterPublished in: CP (2005)
Keyphrases
- linear programming problems
- branch and bound
- mixed integer
- column generation
- optimal solution
- lagrangian heuristic
- network design problem
- lower bound
- branch and bound algorithm
- linear program
- upper bound
- search algorithm
- cutting plane
- combinatorial optimization
- search space
- linear programming
- feasible solution
- lot sizing
- integer programming problems
- mixed integer programming
- valid inequalities
- convex hull
- integer program
- primal dual
- simplex method
- lagrangian relaxation
- np hard
- metaheuristic
- knapsack problem
- objective function
- max sat
- quadratic programming
- interior point methods
- continuous variables
- learning algorithm
- optimization problems
- worst case