Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints.
Siriphong LawphongpanichPublished in: Oper. Res. Lett. (2000)
Keyphrases
- dantzig wolfe decomposition
- network flow problem
- mixed integer programming
- mixed integer
- network design problem
- network flow
- integer programming
- cutting plane
- variational inequalities
- valid inequalities
- minimum cost
- set partitioning
- column generation
- minimal cost
- lot sizing
- constraint programming
- np hard
- feasible solution
- optimal solution
- linear programming problems
- convex hull
- linear program
- continuous variables
- linear programming relaxation
- knapsack problem
- markov random field