A Polynomial Algorithm for Weighted Abstract Flow

DOI10.1007/978-3-540-68891-4_7zbMath1143.90395OpenAlexW1568987606MaRDI QIDQ3503842

S. Thomas McCormick, Maren Martens

Publication date: 10 June 2008

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68891-4_7

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (9)

Separation, dimension, and facet algorithms for node flow polyhedra ⋮ 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

This page was built for publication: A Polynomial Algorithm for Weighted Abstract Flow