Circular Cuts in a Network

DOI10.1287/MOOR.5.3.422MaRDI QIDQ3885549zbMATH OpenOpenAlexFDO

Authors

Publication date 1980

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.5.3.422

zbMATH Keywords

0-1 knapsack problemcircular cutsmax-flow-min-cut

Mathematics Subject Classification ID

Boolean programming (90C09) Programming involving graphs or networks (90C35)

Cited in

(5)

• A decomposition algorithm for multi-terminal network flows
• A note on hypergraph decomposition based on extended minimal sets
• Maximum concurrent flows and minimum cuts
• Multiterminal network flows and applications
• Exact counting of subtrees with diameter no more than d in trees: a generating function approach

This page was built for publication: Circular Cuts in a Network

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