Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm-Reference-Cited by-同舟云学术

Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm

Published:2002-08 Issue:3 Volume:27 Page:504-517
ISSN:0364-765X
Container-title:Mathematics of Operations Research
language:en
Short-container-title:Mathematics of OR

Author:

Adelson-Velsky George M.,Levner Eugene

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications,General Mathematics

Link

https://pubsonline.informs.org/doi/pdf/10.1287/moor.27.3.504.311

Reference11 articles.

1. Adelson-Velsky G. M., Levner E. Routing information flows in networks: A generalization of Dijkstra's algorithm.Proc. Internat. Conf. “Distributed Computer Communication Networks. Theory and Applications”(1999a) November 9–13, 1999(Tel Aviv University, Tel Aviv, Israel) 1–4

2. Decision CPM: Network Reduction and Solution

3. AND/OR graph representation of assembly plans

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

1. Analysis of Flood Evacuation Process in Vulnerable Community with Mutual Aid Mechanism: An Agent-Based Simulation Framework;International Journal of Environmental Research and Public Health;2020-01-15

2. Efficient Real-Time Scalable Make-Before-Break Network Re-Routing;Journal of Optical Communications and Networking;2019-02-01

3. QoS-aware automatic syntactic service composition problem: Complexity and resolution;Future Generation Computer Systems;2018-03

4. Node-independent elementary signaling modes: A measure of redundancy in Boolean signaling transduction networks;Network Science;2016-04-21

5. An approach using SAT solvers for the RCPSP with logical constraints;European Journal of Operational Research;2016-03