A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
DOI10.1016/J.EJOR.2015.01.021zbMATH Open1346.90223OpenAlexW1975435754MaRDI QIDQ319360FDOQ319360
Authors: S. Moradi, Andrea Raith, Matthias Ehrgott 
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/75298/1/Revised_15_1_2015.pdf
Recommendations
- A two-phase algorithm for the biobjective integer minimum cost flow problem
- The biobjective undirected two-commodity minimum cost flow problem
- An alternative method to solve the biobjective minimum cost flow problem
- The biobjective minimum cost flow problem
- A primal-dual simplex algorithm for bi-objective network flow problems
network flowscolumn generationDantzig-Wolfe decompositionbi-objective multi-commodity minimum cost flow problembi-objective simplex method
Linear programming (90C05) Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10) Extreme-point and pivoting methods (90C49)
Cites Work
- Network flows. Theory, algorithms, and applications.
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Programming with linear fractional functionals
- Multicriteria Optimization
- Bicriteria Transportation Problem
- Multi‐objective combinatorial optimization problems: A survey
- Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
- A two-phase algorithm for the biobjective integer minimum cost flow problem
- Finding non-dominated solutions in bi-objective integer network flow problems
- A primal-dual simplex algorithm for bi-objective network flow problems
- On the computation of all supported efficient solutions in multi-objective integer network flow problems
- The biobjective minimum cost flow problem
- A note on \(K\) best network flows
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- Primal-dual simplex method for multiobjective linear programming
- Title not available (Why is that?)
- A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
- Multicommodity network flows—A survey
- The biobjective undirected two-commodity minimum cost flow problem
- Multiple objective minimum cost flow problems: a review
Cited In (14)
- Solving biobjective network flow problem associated with minimum cost-time loading
- Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem
- Bi-objective multistage stochastic linear programming
- Multicommodity flows and Benders decomposition for restricted continuous location problems
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
- Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem
- A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
- Column generation based solution for bi-objective gate assignment problems
- The biobjective undirected two-commodity minimum cost flow problem
- Mean‐standard deviation model for minimum cost flow problem
- A primal-dual simplex algorithm for bi-objective network flow problems
- An extended model and a column generation algorithm for the planar multicommodity flow problem
- Optimization in multimodal freight transportation problems: a survey
- Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes
Uses Software
This page was built for publication: A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319360)
