An alternative method to solve the biobjective minimum cost flow problem

MaRDI QIDQ3626414zbMATH OpenFDO

Authors

Publication date 22 May 2009

zbMATH Keywords

biobjective network flow problemefficient extreme pointsweighted maximum distance

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35)

Recommendations

• The biobjective minimum cost flow problem
• The biobjective undirected two-commodity minimum cost flow problem
• An algorithm for the biobjective integer minimum cost flow problem
• A two-phase algorithm for the biobjective integer minimum cost flow problem
• Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach

Cited in

(20)

• 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
• The biobjective minimum cost flow problem
• Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach
• An approach for the network flow problem with multiple objectives
• A novel approach to subgraph selection with multiple weights on arcs
• The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm
• A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
• Solving biobjective network flow problem associated with minimum cost-time loading
• scientific article; zbMATH DE number 912664 (Why is no real title available?)
• The problem of maximum flow with minimum attainable cost in a network
• A branch-and-bound algorithm for representative integer efficient solutions in multiple objective network programming problems
• An algorithm for the biobjective integer minimum cost flow problem
• Output-sensitive complexity of multi-objective integer network flow problems
• A survey of exact and approximation algorithms for linear-parametric optimization problems
• An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems
• The biobjective undirected two-commodity minimum cost flow problem
• A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem
• Multiple objective minimum cost flow problems: a review

This page was built for publication: An alternative method to solve the biobjective minimum cost flow problem

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