On the Optimal Solutions to AND/OR Series-Parallel Graphs-Reference-Cited by-同舟云学术

On the Optimal Solutions to AND/OR Series-Parallel Graphs

Published:1971-07 Issue:3 Volume:18 Page:354-372
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Simon Richard¹,Lee Richard C. T.¹

Affiliation:

1. National Institutes of Health, Division of Computer Research and Technology, Public Health Service, Department of Health, Education and Welfare, Bethesda, Maryland

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference9 articles.

1. BELLMAN R. Dynamic Programming. Princeton U. Press Princeton N. J. 1957. BELLMAN R. Dynamic Programming. Princeton U. Press Princeton N. J. 1957.

2. Series-parallel graphs and lattices

3. HART P. E. NILSSON N. J. AND RAPHAEL B. A formal basis for the heuristic determination of minimum cost functions. IEEE Trans. System Sci. Cybernetics SSC-4 No. 2 (July 1968) 100-107. HART P. E. NILSSON N. J. AND RAPHAEL B. A formal basis for the heuristic determination of minimum cost functions. IEEE Trans. System Sci. Cybernetics SSC-4 No. 2 (July 1968) 100-107.

4. Branch-and-Bound Methods: A Survey

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

1. Tractability, hardness, and kernelization lower bound for and/or graph solution;Discrete Applied Mathematics;2017-12

2. And/or-convexity: a graph convexity based on processes and deadlock models;Annals of Operations Research;2017-10-03

3. Revisiting the complexity of and/or graph solution;Journal of Computer and System Sciences;2013-11

4. A bibliography of heuristic search research through 1992;IEEE Transactions on Systems, Man, and Cybernetics;1994

5. Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints;Operations Research;1978-02