On finding the K best cuts in a network

Authors:
Horst W. Hamacher;Jean-Claude Picard;Maurice Queyranne
Affiliations:
Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA;Département des Sciences Administratives, Université du Quebec á Montréal, Montréal, Qué. H3C 3P8, Canada;Faculty of Commerce and Business Administration, University of British Columbia, Vancouver, B.C. V6T 1Y8, Canada
Venue:
Operations Research Letters
Year:
1984

Citing 2
Cited 1

A data structure for dynamic trees

Journal of Computer and System Sciences
An O(K·n4) algorithm for finding the k best cuts in a network

Operations Research Letters

On the K best integer network flows

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the O(K . n^4) algorithm of Hamacher (1982) for finding the K best cut-sets fails because it may produce cuts rather than cut-sets. With the convention that two cuts (X, X) and (Y, Y) are different whenever X Y the K best cut problem can be solved in O(K . n^4).