Maximal dynamic polymatroid flows and applications

DOI10.1016/0166-218X(86)90017-XzbMath0594.90023MaRDI QIDQ1077321

Horst W. Hamacher

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

dynamic matroid intersectiondynamic matroid partitioningsdynamic polymatroid flowstime expanded network algorithm

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (1)

Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning

Cites Work

• Unnamed Item
• Unnamed Item
• A time expanded matroid algorithm for finding optimal dynamic matroid intersections
• Computing Maximal “Polymatroidal” Network Flows
• Finding optimum branchings
• Flow Network Formulations of Polymatroid Optimization Problems
• Optimum branchings
• A simple derivation of edmonds' algorithm for optimum branchings

This page was built for publication: Maximal dynamic polymatroid flows and applications