An O(K.n**4) algorithm for finding the K best cuts in a network

DOI10.1016/0167-6377(82)90037-2zbMath0505.90023OpenAlexW2018639409MaRDI QIDQ1836587

Horst W. Hamacher

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0167-6377(82)90037-2

zbMATH Keywords

computational complexitycutsbranching techniqueflow algorithmsfinite directed graphfinding best cuts

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10)

Related Items (1)

On finding the K best cuts in a network

Cites Work

• Two Algorithms for Generating Weighted Spanning Trees in Order
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• Unnamed Item
• Unnamed Item

This page was built for publication: An O(K.n**4) algorithm for finding the K best cuts in a network