An extended model and a column generation algorithm for the planar multicommodity flow problem
From MaRDI portal
Publication:3593364
Recommendations
- A multicommodity network-flow problem with side constraints on paths solved by column generation
- Integer multicommodity flow problems
- scientific article; zbMATH DE number 1086903
- scientific article; zbMATH DE number 1487908
- A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
Cites work
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 679400 (Why is no real title available?)
- scientific article; zbMATH DE number 1368469 (Why is no real title available?)
- Advanced start for the multicommodity network flow problem
- Computational experience with a parallel implementation of an interior-point algorithm for multicommodity network flows
- The Cutting-Plane Method for Solving Convex Programs
Cited in
(5)- Large-scale optimization with the primal-dual column generation method
- A stabilized structured Dantzig-Wolfe decomposition method
- A multicommodity network-flow problem with side constraints on paths solved by column generation
- A gradient search and column generation approach for the build–pack planning problem with approved vendor matrices and stochastic demand
- A generalization of column generation to accelerate convergence
This page was built for publication: An extended model and a column generation algorithm for the planar multicommodity flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593364)