The biobjective undirected two-commodity minimum cost flow problem

DOI10.1016/j.ejor.2003.11.012zbMath1132.90368OpenAlexW1981833492MaRDI QIDQ707093

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

Network flowsBiobjective minimum cost flow problemTwo-commodity flow

Mathematics Subject Classification ID

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

Related Items

Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem ⋮ Generalized minimal cost flow problem in fuzzy nature: an application in bus network planning problem ⋮ A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem ⋮ Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem ⋮ Combinatorial algorithms for the minimum interval cost flow problem ⋮ A two-phase algorithm for the biobjective integer minimum cost flow problem

Uses Software

• NETGEN

Cites Work

• Interactive solutions for the linear multiobjective transportation problem
• Bicriteria network flow problems: Continuous case
• Efficient solutions for the bicriteria network flow problem
• Bicriteria network flow problems: Integer case
• A two-commodity cut theorem
• Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS
• The biobjective minimum cost flow problem
• An approach for the network flow problem with multiple objectives
• Bicriteria Transportation Problem
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• A network simplex method
• Two-Commodity Flow
• The enumeration of all efficient solutions for a linear multiple-objective transportation problem
• Theoretical Properties of the Network Simplex Method
• On Two Commodity Network Flows
• Solving Bicriterion Mathematical Programs
• Two commodity network flows and linear programming
• Multi-Commodity Network Flows
• An algorithm for the biobjective integer minimum cost flow problem
• Unnamed Item
• Unnamed Item
• Unnamed Item