scientific article; zbMATH DE number 871948
From MaRDI portal
Publication:4875223
Recommendations
- A strongly polynomial algorithm for generalized flow maximization
- A strongly polynomial algorithm for generalized flow maximization
- A faster polynomial algorithm for the constrained maximum flow problem
- A Polynomial Algorithm for Weighted Abstract Flow
- A simpler and faster strongly polynomial algorithm for generalized flow maximization
- A simpler and faster strongly polynomial algorithm for generalized flow maximization
- A strongly polynomial algorithm for the minimum maximum flow degree problem
- Polynomial-time algorithms for special cases of the maximum confluent flow problem
- An approximate polynomial method for solving a combinatorial problem of finding the maximum flow in a network
- A polynomial-time simplex method for the maximum \(k\)-flow problem
Cited in
(14)- Partial contraflow with path reversals for evacuation planning
- A Polynomial Algorithm for Weighted Abstract Flow
- Protection of flows under targeted attacks
- Decomposition of probability marginals for security games in abstract networks
- Efficient algorithms for abstract flow with partial switching
- A faster polynomial algorithm for the constrained maximum flow problem
- Abstract flows over time: a first step towards solving dynamic packing problems
- Efficient continuous contraflow algorithms for evacuation planning problems
- Abstract network flow with intermediate storage for evacuation planning
- A critical survey on the network optimization algorithms for evacuation planning problems
- A primal-dual algorithm for weighted abstract cut packing
- A strongly polynomial algorithm for generalized flow maximization
- On maximum flows in polyhedral domains
- scientific article; zbMATH DE number 3906194 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875223)
