A Two-Stage Stochastic Network Model and Solution Methods for the Dynamic Empty Container Allocation Problem
- 1 May 1998
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 32 (2), 142-162
- https://doi.org/10.1287/trsc.32.2.142
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Shipping Container Logistics and AllocationJournal of the Operational Research Society, 1995
- A network recourse decomposition method for dynamic networks with random arc capacitiesNetworks, 1994
- A tabu search procedure for multicommodity location/allocation with balancing requirementsAnnals of Operations Research, 1993
- Chapter 1 Single-Product, single-Location modelsPublished by Elsevier ,1993
- Scenarios and Policy Aggregation in Optimization Under UncertaintyMathematics of Operations Research, 1991
- Nonlinear Programming Techniques Applied to Stochastic Programs with RecoursePublished by Springer Nature ,1988
- Dynamic transshipment networks: An algorithm and its application to the distribution of empty containersNetworks, 1972
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic ProgrammingSIAM Journal on Applied Mathematics, 1969
- Accelerated Stochastic ApproximationThe Annals of Mathematical Statistics, 1958
- An algorithm for quadratic programmingNaval Research Logistics Quarterly, 1956