A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem

DOI10.1016/j.ejor.2015.01.021zbMath1346.90223OpenAlexW1975435754MaRDI QIDQ319360

Andrea Raith, Matthias Ehrgott, Siamak Moradi

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

zbMATH Keywords

column generationDantzig-Wolfe decompositionnetwork flowsbi-objective multi-commodity minimum cost flow problembi-objective simplex method

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Linear programming (90C05) Deterministic network models in operations research (90B10) Extreme-point and pivoting methods (90C49)

Related Items (10)

Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem ⋮ A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem ⋮ Solving biobjective network flow problem associated with minimum cost-time loading ⋮ Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem ⋮ Mean‐standard deviation model for minimum cost flow problem ⋮ Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes ⋮ 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 ⋮ Optimization in multimodal freight transportation problems: a survey ⋮ Bi-objective multistage stochastic linear programming

Uses Software

• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
• The biobjective undirected two-commodity minimum cost flow problem
• Multiple objective minimum cost flow problems: a review
• 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
• Bicriteria Transportation Problem
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Multicommodity network flows—A survey
• Multi‐objective combinatorial optimization problems: A survey
• Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
• Multicriteria Optimization
• Programming with linear fractional functionals

This page was built for publication: A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem