scientific article

zbMath1165.90663MaRDI QIDQ3626414

No author found.

Publication date: 22 May 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

efficient extreme pointsweighted maximum distancebiobjective network flow problem

Mathematics Subject Classification ID

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

Related Items (7)

Multiple objective minimum cost flow problems: a review ⋮ Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach ⋮ A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems ⋮ The problem of maximum flow with minimum attainable cost in a network ⋮ 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

This page was built for publication: