Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS

DOI10.1016/S0305-0548(97)00027-0zbMath0907.90133WikidataQ57932281 ScholiaQ57932281MaRDI QIDQ1265848

Adli Mustafa, Mark Goh

Publication date: 27 September 1998

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

zbMATH Keywords

bicriteria and tricriteria network flow problemsDINASdynamic interactive network analysis systemnonlinear compromise solutions

Mathematics Subject Classification ID

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

Related Items (7)

Multiple objective minimum cost flow problems: a review ⋮ A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems ⋮ The smoothed number of Pareto-optimal solutions in bicriteria integer optimization ⋮ The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization ⋮ Improved smoothed analysis of multiobjective optimization ⋮ The biobjective undirected two-commodity minimum cost flow problem ⋮ Finding integer efficient solutions for multiple objective network programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interactive multiple objective optimization: Survey. I: Continuous case
• Bicriteria network flow problems: Continuous case
• Efficient solutions for the bicriteria network flow problem
• Bicriteria network flow problems: Integer case
• On the efficient point set of tricriteria linear programs
• An interactive algorithm for solving multiple objective integer linear programming problems
• A solver for the multi-objective transshipment problem with facility location
• An approach for the network flow problem with multiple objectives
• Multiobjective transportation network design and routing problems: Taxonomy and annotation
• A mathematical basis for satisficing decision making
• Deterministic network optimization: A bibliography
• Multi‐objective combinatorial optimization problems: A survey

This page was built for publication: Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS