A network recourse decomposition method for dynamic networks with random arc capacities-Reference-Cited by-同舟云学术

A network recourse decomposition method for dynamic networks with random arc capacities

Published:1994-10 Issue:7 Volume:24 Page:369-384
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Powell Warren B.,Cheung Raymond K.-M.

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Reference20 articles.

1. Sublinear upper bounds for stochastic programs with recourse

2. and , An algorithm for multistage dynamic networks with random arc capacitites. Technical Report SOR-92-11, Dept. of Civil Engineering and Operations Research, Princeton University (1992).

3. Stochastic quasi-gradient methods. In: and (eds.), Numerical Techniques for Stochastic Optimization. Springer-Verlag, Berlin (1988).

5. A Successive Linear Approximation Procedure for Stochastic, Dynamic Vehicle Allocation Problems

Cited by 28 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A two-stage stochastic programming framework for evacuation planning in disaster responses;Computers & Industrial Engineering;2020-07

2. Empty vehicle redistribution in autonomous taxi services;EURO Journal on Transportation and Logistics;2019-12

3. Empty vehicle redistribution and fleet size in autonomous taxi systems;IET Intelligent Transport Systems;2019-01-09

4. The matching problem of empty vehicle redistribution in autonomous taxi systems;Procedia Computer Science;2018

5. Loss-constrained minimum cost flow under arc failure uncertainty with applications in risk-aware kidney exchange;IIE Transactions;2015-01-13