Bicriteria network flow problems: Continuous case
From MaRDI portal
Publication:1175771
DOI10.1016/0377-2217(91)90151-KzbMath0753.90028OpenAlexW2094079836MaRDI QIDQ1175771
Publication date: 25 June 1992
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(91)90151-k
Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (16)
Multiobjective transportation network design and routing problems: Taxonomy and annotation ⋮ A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem ⋮ Computing all efficient solutions of the biobjective minimum spanning tree problem ⋮ Multiple objective minimum cost flow problems: a review ⋮ Bicriteria shortest path in networks of queues ⋮ Mean‐standard deviation model for minimum cost flow problem ⋮ Analytic efficient solution set for bi-criteria quadratic network programs ⋮ Efficient solutions for the bicriteria network flow problem ⋮ An algorithm for the biobjective integer minimum cost flow problem ⋮ Bicriteria network flow problems: Integer case ⋮ The biobjective undirected two-commodity 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 method for convex curve approximation ⋮ A primal-dual simplex algorithm for bi-objective network flow problems ⋮ The biobjective minimum cost flow problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
- Multiple Objective Linear Programming with Interval Criterion Weights
- Bicriteria Transportation Problem
- Deterministic network optimization: A bibliography
- Finding all efficient extreme points for multiple objective linear programs
- Solving Bicriterion Mathematical Programs
This page was built for publication: Bicriteria network flow problems: Continuous case