Maximal dynamic polymatroid flows and applications

DOI10.1016/0166-218X(86)90017-XzbMATH Open0594.90023MaRDI QIDQ1077321FDOQ1077321

Authors: Horst W. Hamacher 

Publication date: 1986

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

Recommendations

• Constructing maximal dynamic flows from static flows
• Polymatroidal flow network models with multiple sinks
• scientific article; zbMATH DE number 4075083
• scientific article; zbMATH DE number 1332111
• A time expanded matroid algorithm for finding optimal dynamic matroid intersections

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)

Cites Work

• Title not available (Why is that?)
• Finding optimum branchings
• Optimum branchings
• Title not available (Why is that?)
• Computing Maximal “Polymatroidal” Network Flows
• A simple derivation of edmonds' algorithm for optimum branchings
• A time expanded matroid algorithm for finding optimal dynamic matroid intersections
• Flow Network Formulations of Polymatroid Optimization Problems

Cited In (7)

• Polymatroidal flows with lower bounds
• On maximum flows in polyhedral domains
• Title not available (Why is that?)
• Title not available (Why is that?)
• Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
• Title not available (Why is that?)
• A time expanded matroid algorithm for finding optimal dynamic matroid intersections

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

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