Flows over time in time-varying networks: Optimality conditions and strong duality-Reference-Cited by-同舟云学术

Flows over time in time-varying networks: Optimality conditions and strong duality

Published:2014-09 Issue:2 Volume:237 Page:580-589
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Koch Ronald,Nasrabadi Ebrahim

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference33 articles.

1. Anderson, E. J. (1978). A continuous model for job-shop scheduling. PhD thesis, University of Cambridge.

2. Extreme-points for continuous network programs with arc delays;Anderson;Journal of Information and Optimization Sciences,1989

3. Linear programming in infinite-dimensional spaces;Anderson,1987

4. A class of continuous network flow problems;Anderson;Mathematics of Operations Research,1982

5. A continuous-time network simplex algorithm;Anderson;Networks,1989

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

1. Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle;Optimization Letters;2019-12-10

2. Managing high-end ex-demonstration product returns;European Journal of Operational Research;2019-08

3. A polynomial time algorithm for the minimum flow problem in time-varying networks;Annals of Operations Research;2017-02-28

4. A decremental approach with the A ∗ algorithm for speeding-up the optimization process in dynamic shortest path problems;Measurement;2015-01

5. Continuous-Time Dynamic Shortest Path Problems with Negative Transit Times;SIAM Journal on Control and Optimization;2014-01