Multiple objective minimum cost flow problems: a review
From MaRDI portal
Publication:853016
DOI10.1016/j.ejor.2005.09.033zbMath1102.90059OpenAlexW2150474600MaRDI QIDQ853016
Christian Roed Pedersen, Stefan Ruzika, Horst W. Hamacher
Publication date: 15 November 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.033
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items (19)
A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem ⋮ A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem ⋮ Multiple objective minimum cost flow problems: a review ⋮ On finding representative non-dominated points for bi-objective integer network flow problems ⋮ Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach ⋮ A novel approach to subgraph selection with multiple weights on arcs ⋮ A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems ⋮ Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem ⋮ Solving biobjective network flow problem associated with minimum cost-time loading ⋮ Mean‐standard deviation model for minimum cost flow problem ⋮ An interactive approach for solving the multiobjective minimum cost flow problem in the fuzzy environment ⋮ Finding representative systems for discrete bicriterion optimization problems ⋮ A two-phase algorithm for the biobjective integer minimum cost flow problem ⋮ Finding non-dominated solutions in bi-objective integer network flow problems ⋮ A new method for solving single and multi-objective fuzzy minimum cost flow problems with different membership functions ⋮ Finding integer efficient solutions for multiple objective network programming 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 ⋮ Application of fuzzy minimum cost flow problems to network design under uncertainty
Uses Software
Cites Work
- Multiple objective minimum cost flow problems: a review
- \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
- Algebraic flows in regular matroids
- Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives
- Bicriteria network flow problems: Continuous case
- Efficient solutions for the bicriteria network flow problem
- Bicriteria network flow problems: Integer case
- Connectedness of the set of nondominated outcomes in multicriteria optimization
- Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS
- A method for convex curve approximation
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- The biobjective minimum cost flow problem
- Multicriteria optimization
- Approximation of convex curves with application to the bicriterial minimum cost flow problem
- A note on \(K\) best network flows
- An approach for the network flow problem with multiple objectives
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm
- Proper efficiency and the theory of vector maximization
- Using mathematical programming heuristics in a multicriteria network flow context
- Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
- Bicriteria Transportation Problem
- Sandwich approximation of univariate convex functions with an application to separable convex programming
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- A primal algorithm for solving a capacitated network flow problem with additional linear constraints
- The enumeration of all efficient solutions for a linear multiple-objective transportation problem
- An interactive weighted Tchebycheff procedure for multiple objective programming
- A bad network problem for the simplex method and other minimum cost flow algorithms
- Multi‐objective combinatorial optimization problems: A survey
- Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
- Solving Bicriterion Mathematical Programs
- An algorithm for the biobjective integer minimum cost flow problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Multiple objective minimum cost flow problems: a review
