Maximal dynamic polymatroid flows and applications
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- A simple derivation of edmonds' algorithm for optimum branchings
- 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
Cited in
(7)- scientific article; zbMATH DE number 4075083 (Why is no real title available?)
- Polymatroidal flows with lower bounds
- scientific article; zbMATH DE number 3918059 (Why is no real title available?)
- scientific article; zbMATH DE number 6125195 (Why is no real title available?)
- Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
- A time expanded matroid algorithm for finding optimal dynamic matroid intersections
- On maximum flows in polyhedral domains
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)