Circular Cuts in a Network

DOI10.1287/moor.5.3.422zbMath0442.90092OpenAlexW2067332418MaRDI QIDQ3885549

No author found.

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 problemmax-flow-min-cutcircular cuts

Mathematics Subject Classification ID

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

Related Items (4)

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

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