A two-phase algorithm for the biobjective integer minimum cost flow problem

DOI10.1016/j.cor.2008.06.008zbMath1179.90303OpenAlexW1983895252MaRDI QIDQ1000988

Matthias Ehrgott, Andrea Raith

Publication date: 12 February 2009

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

Full work available at URL: https://doi.org/10.1016/j.cor.2008.06.008

zbMATH Keywords

two phase method\(k\) best flow algorithmbiobjective integer minimum cost flow problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10)

Related Items (20)

Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem ⋮ Guided moth-flame optimiser for multi-objective optimization problems ⋮ A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem ⋮ Choquet optimal set in biobjective combinatorial optimization ⋮ 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 hybrid approach for biobjective optimization ⋮ A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems ⋮ Multi-modal cargo logistics distribution problem: decomposition of the stochastic risk-averse models ⋮ Solving biobjective network flow problem associated with minimum cost-time loading ⋮ Two‐phase strategies for the bi‐objective minimum spanning tree problem ⋮ On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems ⋮ A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the Knapsack problem ⋮ Mean‐standard deviation model for minimum cost flow problem ⋮ A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs ⋮ Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations ⋮ Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming ⋮ Finding non-dominated solutions in bi-objective integer network flow problems ⋮ Finding integer efficient solutions for multiple objective network programming problems ⋮ An algorithm for solving the bi-objective median path-shaped facility on a tree network

Uses Software

• MCF
• Netgen
• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
• The biobjective undirected two-commodity minimum cost flow problem
• Multiple objective minimum cost flow problems: a review
• A comparison of solution strategies for biobjective shortest path problems
• Efficient solutions for the bicriteria network flow problem
• Bicriteria network flow problems: Integer case
• The biobjective minimum cost flow problem
• A note on \(K\) best network flows
• Two phase algorithms for the bi-objective assignment problem
• The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm
• Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• A network simplex method
• Linear Programming
• Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
• An algorithm for the biobjective integer minimum cost flow problem

This page was built for publication: A two-phase algorithm for the biobjective integer minimum cost flow problem