Updating network flows given multiple, heterogeneous arc attribute changes
From MaRDI portal
Recommendations
- A network flow approach to a city emergency evacuation planning
- Dual Algorithms for Pure Network Problems
- Minimum cost flow in a network with an overestimated arc capacity
- A computational study of cost reoptimization for min-cost flow problems
- On the use of lexicographic min cost flows in evacuation modeling
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 1239298 (Why is no real title available?)
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- A computational study of cost reoptimization for min-cost flow problems
- A reoptimization algorithm for the shortest path problem with time windows
- Dual Algorithms for Pure Network Problems
- Dynamic programming and stochastic control
- Network Reoptimization Algorithms: A Statistically Designed Comparison
- Network flows. Theory, algorithms, and applications.
- New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
- On solving quickest time problems in time-dependent, dynamic networks
- Reoptimization procedures for bounded variable primal simplex network algorithms
- Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Time-varying minimum cost flow problems
This page was built for publication: Updating network flows given multiple, heterogeneous arc attribute changes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q655194)
