A note on \(K\) best network flows

DOI10.1007/BF02099691zbMath0838.90033MaRDI QIDQ1897375

Horst W. Hamacher

Publication date: 30 May 1996

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

polynomial time algorithmlinear integer network flowmultiple-criteria network flow

Mathematics Subject Classification ID

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

Related Items (10)

Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach ⋮ A decision-theoretic approach to robust optimization in multivalued graphs ⋮ A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem ⋮ Multiple objective minimum cost flow problems: a review ⋮ An efficient procedure for finding best compromise solutions to the multi-objective assignment problem ⋮ Choquet-based optimisation in multiobjective shortest path and spanning tree problems ⋮ Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem ⋮ A two-phase algorithm for the biobjective integer minimum cost flow problem ⋮ On the \(K\) shortest path trees problem ⋮ On the computation of all supported efficient solutions in multi-objective integer network flow problems

Cites Work

• Duality for balanced submodular flows
• On finding the K best cuts in a network
• Algorithms for finding k-best perfect matchings
• k-optimal solution sets for some polynomially solvable scheduling problems
• Note on combinatorial optimization with max-linear objective functions
• A new exchange property for matroids and its application to max-min-problems
• Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems
• Intersection of Two Matroids: (Condensed) Border Graphs and Ranking
• Thek best spanning arborescences of a network
• Minimal cost flows in regular matroids
• Two Algorithms for Generating Weighted Spanning Trees in Order
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on \(K\) best network flows