The biobjective undirected two-commodity minimum cost flow problem

DOI10.1016/J.EJOR.2003.11.012MaRDI QIDQ707093zbMATH OpenOpenAlexFDO

Authors D. Kharzeev

Publication date 9 February 2005

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2003.11.012

zbMATH Keywords

Biobjective minimum cost flow problemNetwork flowsTwo-commodity flow

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35)

Recommendations

• The biobjective minimum cost flow problem
• A new strategy for the undirected two-commodity maximum flow problem
• An alternative method to solve the biobjective minimum cost flow problem
• A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
• A two-phase algorithm for the biobjective integer minimum cost flow problem

Cites work

• A network simplex method
• A two-commodity cut theorem
• An algorithm for the biobjective integer minimum cost flow problem
• An approach for the network flow problem with multiple objectives
• Bicriteria network flow problems: Continuous case
• Bicriteria network flow problems: Integer case
• Bicriteria Transportation Problem
• Efficient solutions for the bicriteria network flow problem
• Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS
• scientific article; zbMATH DE number 3845309 (Why is no real title available?)
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• Interactive solutions for the linear multiobjective transportation problem
• Multi-Commodity Network Flows
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Network flows. Theory, algorithms, and applications.
• On Two Commodity Network Flows
• Solving Bicriterion Mathematical Programs
• The biobjective minimum cost flow problem
• The enumeration of all efficient solutions for a linear multiple-objective transportation problem
• Theoretical Properties of the Network Simplex Method
• Two commodity network flows and linear programming
• Two-Commodity Flow

Cited in

(11)

• A two-phase algorithm for the biobjective integer minimum cost flow problem
• The biobjective minimum cost flow problem
• Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem
• Combinatorial algorithms for the minimum interval cost flow problem
• A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
• Bi-objective min-flow problem with capacity and flow constraints
• An alternative method to solve the biobjective minimum cost flow problem
• An algorithm for the biobjective integer minimum cost flow problem
• Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem
• A new strategy for the undirected two-commodity maximum flow problem
• Generalized minimal cost flow problem in fuzzy nature: an application in bus network planning problem

Describes a project that uses

Uses Software

• NETGEN

This page was built for publication: The biobjective undirected two-commodity minimum cost flow problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q707093)