Optimal problem-solving search: All-or-none solutions
Artificial IntelligencePublished 1 January 1975Open access
Herbert A. Simon, Joseph B. Kadane
Citations129
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Optimal algorithms are derived for satisficing problem-solving search, that is, search where the goal is to reach any solution, no distinction being made among different solutions.
Abstract
Computer Science Department
Keywords
Computer Science
Discrete MathematicsOptimal task sequencing with precedence constraints
94 Citations1973M. R. Garey
A number of reduction theorems are shown to lead to a very efficient optimization algorithm for a large class of task ordering problems, and how their use can improve upon exhaustive search techniques.
Artificial IntelligenceAn admissible and optimal algorithm for searching AND/OR graphs
87 Citations1971C. L. Chang, James R. Slagle
In this paper, an algorithm for searching for a minimal solution graph in an AND/OR graph is described and if the “lower bound” condition is satisfied, the algorithm is guaranteed to find a minimal solutions graph when one exists.
Munich Personal RePEc Archive (Ludwig Maximilian University of Munich)Research program effectiveness
58 Citations1965Dorothy M. Gilford, Marshall C. Yovits
This volume comprises the proceedings of the 1965 Conference on Research Program Effectiveness, to identify high-priority opportunities for advancing the theory and practice of research program management through the application of scientific methods.
IEEE Transactions on Engineering ManagementOrganizations of unsuccessful R&D projects
21 Citations1971William B. Joyce