A primal-dual simplex algorithm for bi-objective network flow problems

DOI10.1007/s10288-008-0087-3zbMath1177.90359OpenAlexW2043648369MaRDI QIDQ1041407

José Rui Figueira, Matthias Ehrgott, Augusto Eusébio

Publication date: 2 December 2009

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-008-0087-3

zbMATH Keywords

multi-objective linear programming

Mathematics Subject Classification ID

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

Related Items (5)

A parametric simplex algorithm for biobjective piecewise linear programming problems ⋮ A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem ⋮ Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach ⋮ Solving biobjective network flow problem associated with minimum cost-time loading ⋮ On the computation of all supported efficient solutions in multi-objective integer network flow problems

Uses Software

• NETGEN

Cites Work

• Multiple objective minimum cost flow problems: a review
• Bicriteria network flow problems: Continuous case
• Efficient solutions for the bicriteria network flow problem
• The biobjective minimum cost flow problem
• Outcome space partition of the weight set in multiobjective linear programming
• Primal-dual simplex method for multiobjective linear programming
• An efficient implementation of the network simplex method
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Multicriteria Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A primal-dual simplex algorithm for bi-objective network flow problems