On finding the K best cuts in a network

DOI10.1016/0167-6377(84)90083-XzbMATH Open0536.90088OpenAlexW2071110640MaRDI QIDQ792224FDOQ792224

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

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)

Cites Work

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

Cited In (4)

• The \(K\)th TSP is pseudopolynomial when TSP is polynomial
• Approximating \(k\)-cuts using network strength as a Lagrangean relaxation
• Mimicking Networks and Succinct Representations of Terminal Cuts
• A note on \(K\) best network flows

This page was built for publication: On finding the K best cuts in a network

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