Computational experience with a difficult mixed-integer multicommodity flow problem.
Daniel BienstockOktay GünlükPublished in: Math. Program. (1995)
Keyphrases
- mixed integer
- benders decomposition
- cutting plane
- linear program
- feasible solution
- lot sizing
- network design problem
- mixed integer programming
- convex hull
- continuous relaxation
- optimal solution
- valid inequalities
- dynamic programming
- quadratic program
- mixed integer program
- linear programming
- exact algorithms
- lower bound
- search algorithm
- neural network