scientific article; zbMATH DE number 871948

zbMath0845.90048MaRDI QIDQ4875223

S. Thomas McCormick

Publication date: 15 September 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomial algorithmmax flow/min cut theoremsupermodular objective

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)

Related Items

Efficient continuous contraflow algorithms for evacuation planning problems, Decomposition of probability marginals for security games in abstract networks, Unnamed Item, Protection of flows under targeted attacks, A Primal-Dual Algorithm for Weighted Abstract Cut Packing, Abstract flows over time: a first step towards solving dynamic packing problems, Partial contraflow with path reversals for evacuation planning, Efficient algorithms for abstract flow with partial switching, Abstract network flow with intermediate storage for evacuation planning