Selecting the right heuristic algorithm: Runtime performance predictors-Reference-Cited by-同舟云学术

Selecting the right heuristic algorithm: Runtime performance predictors

Published:1996 Issue: Volume: Page:41-53
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Allen John A.,Minton Steven

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-61291-2_40

Reference18 articles.

1. P. Cheeseman, B. Kanefsky, and W. Taylor. Where the really hard problems are. In Proceedings of the 12 th IJCAI, pages 331–337, Sydney, Australia, 1991. Morgan Kaufmann.

2. F. Glover. Tabu search — part I. ORSA Journal on Computing, 1(3):190–206, 1989.

3. F. Glover. Tabu search — part II. ORSA Journal on Computing, 2:4–32, 1990.

4. M. Johnston and S. Minton. Analyzing a heuristic strategy for constraint-satisfaction and scheduling. In M. Zweben and M. Fox, editors, Intelligent Scheduling, pages 257–290. Morgan Kaufmann, 1994.

5. L. Kale. An almost perfect heuristic for the n nonattacking queens problem. Inf. Process. Lett, 34:173–178, 1990.

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

1. From Selecting Best Algorithm to Explaining Why It is: A General Review, Formal Problem Statement and Guidelines Towards to an Empirical Generalization;Computational Science and Its Applications – ICCSA 2023;2023

2. Algorithm Selection for Combinatorial Search Problems: A Survey;Data Mining and Constraint Programming;2016

3. Adaptive Constraint Satisfaction: The Quickest First Principle;Intelligent Systems Reference Library;2009

4. A study of mechanisms for improving robotic group performance;Artificial Intelligence;2008-04

5. Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory;Principles and Practice of Constraint Programming – CP 2004;2004