A Polynomial Algorithm for Weighted Abstract Flow

DOI10.1007/978-3-540-68891-4_7MaRDI QIDQ3503842zbMATH OpenOpenAlexFDO

Authors Maren Martens, S. Thomas McCormick

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)

Recommendations

• scientific article; zbMATH DE number 871948
• A polynomial time constant approximation for minimizing total weighted flow-time
• A strongly polynomial algorithm for generalized flow maximization
• A strongly polynomial algorithm for generalized flow maximization
• A polynomial combinatorial algorithm for generalized minimum cost flow
• scientific article; zbMATH DE number 1874432
• scientific article; zbMATH DE number 1757944
• A simpler and faster strongly polynomial algorithm for generalized flow maximization
• A simpler and faster strongly polynomial algorithm for generalized flow maximization
• On the computational behavior of a polynomial-time network flow algorithm

Cited in

(12)

• Decomposition of probability marginals for security games in abstract networks
• Protection of flows under targeted attacks
• Abstract flows over time: a first step towards solving dynamic packing problems
• A primal-dual algorithm for weighted abstract cut packing
• Decomposition of probability marginals for security games in max-flow/min-cut systems
• Separation, dimension, and facet algorithms for node flow polyhedra
• Decomposing probability marginals beyond affine requirements
• A critical survey on the network optimization algorithms for evacuation planning problems
• scientific article; zbMATH DE number 871948 (Why is no real title available?)
• Efficient algorithms for abstract flow with partial switching
• Abstract network flow with intermediate storage for evacuation planning
• Partial contraflow with path reversals for evacuation planning

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

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