An extended model and a column generation algorithm for the planar multicommodity flow problem
From MaRDI portal
Publication:3593364
DOI10.1002/NET.20161zbMATH Open1119.90064OpenAlexW4245712206MaRDI QIDQ3593364FDOQ3593364
Authors: Filipe Alvelos, José Valério de Carvalho 
Publication date: 20 July 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20161
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
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Cutting-Plane Method for Solving Convex Programs
- Advanced start for the multicommodity network flow problem
- Title not available (Why is that?)
- Computational experience with a parallel implementation of an interior-point algorithm for multicommodity network flows
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
Uses Software
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)
