Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach
DOI10.1016/j.cor.2017.01.004zbMath1391.90566OpenAlexW2580895947WikidataQ56476121 ScholiaQ56476121MaRDI QIDQ1652278
Antonio Sedeño-Noda, Andrea Raith
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.01.004
network flow algorithmparametric simplex methodbiobjective minimum cost flow problemextreme supported efficient solutions
Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Deterministic network models in operations research (90B10)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On finding representative non-dominated points for bi-objective integer network flow problems
- A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
- Multiple objective minimum cost flow problems: a review
- A two-phase algorithm for the biobjective integer minimum cost flow problem
- Finding non-dominated solutions in bi-objective integer network flow problems
- A primal-dual simplex algorithm for bi-objective network flow problems
- On the computation of all supported efficient solutions in multi-objective integer network flow problems
- The biobjective minimum cost flow problem
- Minimum-cost flow algorithms: an experimental evaluation
- Solving scalarized multi-objective network flow problems using an interior point method
- Finding integer efficient solutions for multiple objective network programming problems
- A network simplex method
- Linear Programming
- Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
- Fibonacci heaps and their uses in improved network optimization algorithms
This page was built for publication: Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach
