A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation.
Kaj HolmbergDi YuanPublished in: INFORMS J. Comput. (2003)
Keyphrases
- network flow problem
- integer program
- column generation
- network flow
- network design problem
- mixed integer programming
- valid inequalities
- integer programming
- mixed integer
- branch and bound
- linear programming
- linear program
- minimum cost
- constraint programming
- lagrangian relaxation
- linear programming problems
- minimal cost
- cutting plane
- np hard
- set partitioning
- dantzig wolfe decomposition
- optimal solution
- exact solution
- search algorithm
- lp relaxation
- optimization model
- lower bound
- approximation algorithms
- branch and bound algorithm
- constraint satisfaction
- upper bound
- search space
- dual variables
- global constraints
- bipartite graph
- feasible solution
- multistage
- constraint satisfaction problems
- special case