A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem.
Matteo FischettiCarlo PoloMassimo ScantamburloPublished in: Networks (2004)
Keyphrases
- mixed integer program
- network design problem
- lagrangian relaxation
- mixed integer
- valid inequalities
- mixed integer programming
- feasible solution
- branch and bound
- binary variables
- continuous variables
- optimal solution
- integer programming
- cutting plane
- linear program
- branch and bound algorithm
- lot sizing
- lower bound
- linear programming
- lower and upper bounds
- traveling salesman problem
- dynamic programming
- column generation
- linear programming relaxation
- combinatorial optimization
- convex hull
- network design
- random variables
- approximation algorithms
- minimal cost
- search algorithm
- objective function
- np hard
- upper bound
- production planning
- shortest path