Multiple objective minimum cost flow problems: a review

DOI10.1016/J.EJOR.2005.09.033zbMATH Open1102.90059OpenAlexW2150474600MaRDI QIDQ853016FDOQ853016

Authors: Horst W. Hamacher, Christian Roed Pedersen, Stefan Ruzika 

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

Recommendations

• The biobjective minimum cost flow problem
• An alternative method to solve the biobjective minimum cost flow problem
• An algorithm for the biobjective integer minimum cost flow problem
• scientific article; zbMATH DE number 1217674
• Bi-objective min-flow problem with capacity and flow constraints

zbMATH Keywords

network flowsapproximationefficient solutionmultiple objective programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Cites Work

• Network flows. Theory, algorithms, and applications.
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Multiple criteria optimization: State of the art annotated bibliographic surveys
• Multicriteria optimization
• Title not available (Why is that?)
• Proper efficiency and the theory of vector maximization
• Solving Bicriterion Mathematical Programs
• Bicriteria Transportation Problem
• An interactive weighted Tchebycheff procedure for multiple objective programming
• Multi‐objective combinatorial optimization problems: A survey
• Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
• The biobjective minimum cost flow problem
• A note on \(K\) best network flows
• Multiobjective transportation network design and routing problems: Taxonomy and annotation
• Multiple objective minimum cost flow problems: a review
• Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
• Title not available (Why is that?)
• \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
• Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives
• Algebraic flows in regular matroids
• Bicriteria network flow problems: Integer case
• An algorithm for the biobjective integer minimum cost flow problem
• The enumeration of all efficient solutions for a linear multiple-objective transportation problem
• A method for convex curve approximation
• An alternative method to solve the biobjective minimum cost flow problem
• A primal algorithm for solving a capacitated network flow problem with additional linear constraints
• Using mathematical programming heuristics in a multicriteria network flow context
• Connectedness of the set of nondominated outcomes in multicriteria optimization
• Approximation of convex curves with application to the bicriterial minimum cost flow problem
• The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm
• Bicriteria network flow problems: Continuous case
• Efficient solutions for the bicriteria network flow problem
• Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS
• An approach for the network flow problem with multiple objectives
• Title not available (Why is that?)
• Title not available (Why is that?)
• A bad network problem for the simplex method and other minimum cost flow algorithms
• Title not available (Why is that?)
• Sandwich approximation of univariate convex functions with an application to separable convex programming
• Title not available (Why is that?)

Cited In (21)

• A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem
• Solving biobjective network flow problem associated with minimum cost-time loading
• Finding integer efficient solutions for multiple objective network programming problems
• An interactive approach for solving the multiobjective minimum cost flow problem in the fuzzy environment
• A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
• An approach for the network flow problem with multiple objectives
• Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach
• A new method for solving single and multi-objective fuzzy minimum cost flow problems with different membership functions
• On finding representative non-dominated points for bi-objective integer network flow problems
• Multiple objective minimum cost flow problems: a review
• A two-phase algorithm for the biobjective integer minimum cost flow problem
• Mean‐standard deviation model for 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
• Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem
• Minimum cost multi-product flow lines
• Application of fuzzy minimum cost flow problems to network design under uncertainty
• Finding representative systems for discrete bicriterion optimization problems
• A branch-and-bound algorithm for representative integer efficient solutions in multiple objective network programming problems
• A novel approach to subgraph selection with multiple weights on arcs

Uses Software

• NETGEN

This page was built for publication: Multiple objective minimum cost flow problems: a review

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853016)