A dynamic version for the Network Simplex Algorithm
- 1 November 2014
- journal article
- Published by Elsevier BV in Applied Soft Computing
- Vol. 24, 414-422
- https://doi.org/10.1016/j.asoc.2014.07.017
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Minimum flow problem on network flows with time-varying boundsApplied Mathematical Modelling, 2011
- An introduction to dynamic generative networks: Minimum cost flowApplied Mathematical Modelling, 2011
- A Network Flow Algorithm for the Cell-Based Single-Destination System Optimal Dynamic Traffic Assignment ProblemTransportation Science, 2011
- A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminalsComputers & Mathematics with Applications, 2011
- A Parametric Approach to the Bi-criteria Minimum Cost Dynamic Flow ProblemOpen Journal of Discrete Mathematics, 2011
- Minimum cost time-varying network flow problemsOptimization Methods and Software, 2010
- A decision support system for operations in a container terminalDecision Support Systems, 2005
- Dispatching multi-load AGVs in highly automated seaport container terminalsOR Spectrum, 2004
- A survey of dynamic network flowsAnnals of Operations Research, 1989
- An efficient implementation of the network simplex methodMathematical Programming Studies, 1986