On finding the K best cuts in a network

DOI10.1016/0167-6377(84)90083-XzbMath0536.90088OpenAlexW2071110640MaRDI QIDQ792224

Jean-Claude Picard, Maurice Queyranne, Horst W. Hamacher

Publication date: 1984

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(84)90083-x

zbMATH Keywords

counterexamplebest cutsflow algorithmranking of solutions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

A note on \(K\) best network flows, The Kth TSP is pseudopolynomial when TSP is polynomial

Cites Work

• An O(K.n**4) algorithm for finding the K best cuts in a network
• Some Network Flow Problems Solved with Pseudo-Boolean Programming
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
• Unnamed Item
• Unnamed Item