The effectiveness of finite improvement algorithms for finding global optima-Reference-Cited by-同舟云学术

The effectiveness of finite improvement algorithms for finding global optima

Published:1993-10 Issue:3 Volume:37 Page:257-272
ISSN:0340-9422
Container-title:ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research
language:en
Short-container-title:ZOR - Methods and Models of Operations Research

Author:

Jacobson Sheldon H.,Solow Daniel

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01415994.pdf

Reference15 articles.

1. Cook SA (1971) The complexity of theorem-proving procedures. Proc 3rd Ann. ACM Sym. on Theory of Computing, Association for Computing Machinery, New York, 151?158

2. Cowles Commission Monograph;GB Dantzig,1951

3. Dantzig GB, Orden A, Wolfe P (1955) The generalized simplex method for minimizing a linear form under linear inequality restraints. Pacific J Math 5:183?195

4. Edmonds J, Karp RM (1972) Theoretical improvements in algorithmic efficiency for network flow problems. J of the Assoc. for Comp. Mach. 19:248?264

5. Ford LR, Fulkerson DR (1956) Maximal flow through a network. Can J Math 8:399?404

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

1. An analysis of neighborhood functions on generic solution spaces;European Journal of Operational Research;2008-04

2. Analyzing the Complexity of Finding Good Neighborhood Functions for Local Search Algorithms;Journal of Global Optimization;2006-06-14

3. Order preserving reductions and polynomial improving paths;Operations Research Letters;2006-01

4. Analyzing the Performance of Generalized Hill Climbing Algorithms;Journal of Heuristics;2004-07

5. Global Optimization Performance Measures for Generalized Hill Climbing Algorithms;Journal of Global Optimization;2004-06