Efficient solutions for the bicriteria network flow problem

DOI10.1016/0305-0548(92)90034-3zbMath0758.90030OpenAlexW2082300779MaRDI QIDQ1202272

Haijune Lee, P. Simin Pulat, Fenghueih Huarng

Publication date: 18 February 1993

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

Full work available at URL: https://doi.org/10.1016/0305-0548(92)90034-3

zbMATH Keywords

bicriteria network flowanti-stalling rulescycle preventiongeneration of efficient basic feasible solutions

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem, Multiple objective minimum cost flow problems: a review, A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems, Mean‐standard deviation model for minimum cost flow problem, An algorithm for the biobjective integer minimum cost flow problem, The biobjective undirected two-commodity minimum cost flow problem, A two-phase algorithm for the biobjective integer minimum cost flow problem, Finding non-dominated solutions in bi-objective integer network flow problems, Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS, A primal-dual simplex algorithm for bi-objective network flow problems, The biobjective minimum cost flow problem

Uses Software

• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• On a multicriteria shortest path problem
• Interactive solutions for the linear multiobjective transportation problem
• Nondominated solutions of cost-time trade-off transportation and assignment problems
• A transportation problem with objectives to minimize total cost and duration of transportation
• A bicriterion shortest path algorithm
• Bicriteria network flow problems: Continuous case
• Bicriteria network flow problems: Integer case
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• Generating all maximal efficient faces for multiple objective linear programs
• A resolution method for multiobjective problems
• A Special Multi-Objective Assignment Problem
• Anti-stalling pivot rules for the network simplex algorithm
• An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Bicriteria Transportation Problem
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• Finding all efficient extreme points for multiple objective linear programs
• The enumeration of all efficient solutions for a linear multiple-objective transportation problem
• Theoretical Properties of the Network Simplex Method
• A revised simplex method for linear multiple objective programs
• Technical Note—Proper Efficiency and the Linear Vector Maximum Problem