On the computation of all supported efficient solutions in multi-objective integer network flow problems

DOI10.1016/j.ejor.2008.10.031zbMath1176.90535OpenAlexW2093251777MaRDI QIDQ1042100

José Rui Figueira, Augusto Eusébio

Publication date: 7 December 2009

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

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

zbMATH Keywords

parametric programmingmulti-objective linear and integer programmingmulti-objective network flowsnegative-cycle algorithms

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29)

Related Items (5)

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 ⋮ Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach ⋮ A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems ⋮ Finding integer efficient solutions for multiple objective network programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiple objective minimum cost flow problems: a review
• Finding non-dominated solutions in bi-objective integer network flow problems
• A primal-dual simplex algorithm for bi-objective network flow problems
• Bicriteria network flow problems: Integer case
• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
• A note on \(K\) best network flows
• The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm
• Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• Multicriteria Optimization
• An algorithm for the biobjective integer minimum cost flow problem

This page was built for publication: On the computation of all supported efficient solutions in multi-objective integer network flow problems