Finding non-dominated solutions in bi-objective integer network flow problems

DOI10.1016/j.cor.2008.11.001zbMath1179.90049OpenAlexW2053678873MaRDI QIDQ1010260

José Rui Figueira, Augusto Eusébio

Publication date: 3 April 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.11.001

zbMATH Keywords

efficient solutionsnon-dominated solutionsnetwork simplex algorithmbi-objective integer network flows

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10)

Related Items (11)

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 ⋮ On finding representative non-dominated points for bi-objective integer network flow problems ⋮ Efficient automated schematic map drawing using multiobjective mixed integer programming ⋮ 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 ⋮ On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems ⋮ Mean‐standard deviation model for minimum cost flow problem ⋮ Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems ⋮ Finding integer efficient solutions for multiple objective network programming problems ⋮ On the computation of all supported efficient solutions in multi-objective integer network flow problems

Uses Software

• SPSS
• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiple objective minimum cost flow problems: a review
• A two-phase algorithm for the biobjective integer minimum cost flow problem
• Analysis of the objective space in multiple objective linear programming
• Bicriteria network flow problems: Continuous case
• Efficient solutions for the bicriteria network flow problem
• Bicriteria network flow problems: Integer case
• The biobjective minimum cost flow problem
• The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm
• An efficient implementation of the network simplex method
• Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Statistical Analysis of Computational Tests of Algorithms and Heuristics
• A bad network problem for the simplex method and other minimum cost flow algorithms
• Multicriteria Optimization
• An algorithm for the biobjective integer minimum cost flow problem

This page was built for publication: Finding non-dominated solutions in bi-objective integer network flow problems