scientific article; zbMATH DE number 3906193

MaRDI QIDQ3683848zbMATH OpenFDO

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

Publication date 1984

zbMATH Keywords

best cut-setsbest cutsmaximum flowsminimum cuts

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 3848942
• Suboptimal cuts: their enumeration, weight and number (extended abstract)
• Finding k Cuts within Twice the Optimal
• scientific article; zbMATH DE number 3900472
• A note on \(K\) best network flows

Cited in

(13)

• An O(K.n**4) algorithm for finding the K best cuts in a network
• A note on \(K\) best network flows
• scientific article; zbMATH DE number 3848942 (Why is no real title available?)
• On the K best integer network flows
• The maximum flow problem with disjunctive constraints
• scientific article; zbMATH DE number 4031432 (Why is no real title available?)
• Rank of Handelman hierarchy for Max-Cut
• Suboptimal cuts: their enumeration, weight and number (extended abstract)
• Mimicking Networks and Succinct Representations of Terminal Cuts
• Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k
• On finding the K best cuts in a network
• Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
• Methods for the one-dimensional space allocation problem

This page was built for publication:

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