The biobjective minimum cost flow problem

DOI10.1016/S0377-2217(99)00191-5zbMath0969.90020MaRDI QIDQ1578006

N. Delaunay

Publication date: 19 September 2000

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

zbMATH Keywords

network programming; efficient extreme points; biobjective minimum cost flow problem

Mathematics Subject Classification ID

90B10: Deterministic network models in operations research

Uses Software

• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interactive solutions for the linear multiobjective transportation problem
• Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
• Bicriteria network flow problems: Continuous case
• Efficient solutions for the bicriteria network flow problem
• Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint
• An approach for the network flow problem with multiple objectives
• Anti-stalling pivot rules for the network simplex algorithm
• Bicriteria Transportation Problem
• A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• A network simplex method
• Linear Multiparametric Programming by Multicriteria Simplex Method
• The enumeration of all efficient solutions for a linear multiple-objective transportation problem
• Theoretical Properties of the Network Simplex Method
• Solving Bicriterion Mathematical Programs