Subproblem ordering heuristics for AND/OR best-first search

DOI10.1016/j.jcss.2017.10.003zbMath1390.68602OpenAlexW2767962444MaRDI QIDQ1745717

Xianqiang Yang

Publication date: 18 April 2018

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/111987

zbMATH Keywords

combinatorial optimizationartificial intelligenceheuristic searchgraphical models

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Stacking sequences in composite laminates through design optimization

Cites Work

• Unnamed Item
• Linear-space best-first search
• Hybrid backtracking bounded by tree-decomposition of constraint networks
• AND/OR search spaces for graphical models
• AND/OR branch-and-bound search for combinatorial optimization in graphical models
• Memory intensive AND/OR search for combinatorial optimization in graphical models
• Depth-first iterative-deepening: An optimal admissible tree search
• Earth observation satellite management
• Anytime AND/OR depth-first search for combinatorial optimization
• Mini-buckets
• Residual-Guided Look-Ahead in AND/OR Search for Graphical Models
• Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms
• Recursive conditioning

This page was built for publication: Subproblem ordering heuristics for AND/OR best-first search