Updating network flows given multiple, heterogeneous arc attribute changes
From MaRDI portal
Publication:655194
DOI10.1007/S10852-010-9129-XzbMATH Open1229.90030OpenAlexW1994098060MaRDI QIDQ655194FDOQ655194
Authors: Hao Tang, Zhiying Chen, Elise Miller-Hooks 
Publication date: 2 January 2012
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-010-9129-x
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
- A computational study of cost reoptimization for min-cost flow problems
- Network flows. Theory, algorithms, and applications.
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- Title not available (Why is that?)
- A reoptimization algorithm for the shortest path problem with time windows
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Dynamic programming and stochastic control
- Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
- On solving quickest time problems in time-dependent, dynamic networks
- Title not available (Why is that?)
- New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
- Reoptimization procedures for bounded variable primal simplex network algorithms
- Dual Algorithms for Pure Network Problems
- Network Reoptimization Algorithms: A Statistically Designed Comparison
- Time-varying minimum cost flow problems
Uses Software
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)
