Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem

DOI10.1016/j.dam.2022.07.007zbMath1500.90080arXiv2105.10225OpenAlexW3164098169WikidataQ113877176 ScholiaQ113877176MaRDI QIDQ2172416

Yanyan Li

Publication date: 15 September 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.10225

zbMATH Keywords

combinatorial optimizationminimum cost flow\(K\) best network flowall optimal solutionsinteger network flow algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Uses Software

• Algorithm 447

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the \(K\) best integer network flows
• Multiple objective minimum cost flow problems: a review
• Branch \& Sample: A simple strategy for constraint satisfaction
• A network model for airline cabin crew scheduling
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A note on \(K\) best network flows
• Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory
• Fast Algorithms for Finding Nearest Common Ancestors
• Finding all optimal solutions to the network flow problem
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs

This page was built for publication: Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem