scientific article; zbMATH DE number 3845070

MaRDI QIDQ3315012zbMATH OpenFDO

Authors

Publication date 1982

zbMATH Keywords

admissible heuristicbranch-and-bound algorithmbranch-and-bound treesdominance testheuristic searchshortest paths in networks

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Recommendations

• Three approaches to heuristic search in networks
• Are branch and bound and A\(^{\ast}\) algorithms identical?
• scientific article; zbMATH DE number 3880462
• Heuristic search and related boundary value problems
• Weighted heuristic search in networks

Cited in

(14)

• Are branch and bound and A\(^{\ast}\) algorithms identical?
• Heuristic search and related boundary value problems
• Resolution search and dynamic branch-and-bound
• Research note: the point of diminishing returns in heuristic search
• Heuristics of the Cocks-Pinch method
• Three approaches to heuristic search in networks
• scientific article; zbMATH DE number 1488101 (Why is no real title available?)
• scientific article; zbMATH DE number 1568943 (Why is no real title available?)
• Heuristic Problem Solving: The Next Advance in Operations Research
• Heuristic estimates in shortest path algorithms
• Chapter 9: An MPEC based heuristic
• Quantifying heuristics in the ordinal optimization framework
• A heuristic search algorithm with modifiable estimate
• General branch and bound, and its relation to A^* and AO^*

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3315012)