State-Space Search

DOI10.1007/978-1-4612-1538-7MaRDI QIDQ4939497zbMATH OpenOpenAlexFDO

Authors Weixiong Zhang

Publication date 6 February 2000

Full work available at URL https://doi.org/10.1007/978-1-4612-1538-7

zbMATH Keywords

branch and boundcombinatorial optimizationstate space searchtravelling salesman problem

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Performance of linear-space search algorithms
• Random Trees and the Analysis of Branch and Bound Procedures
• Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search
• scientific article; zbMATH DE number 1334602
• On tree search algorithms

Cited in

(11)

• Heuristic search and related boundary value problems
• Nagging: A scalable fault-tolerant paradigm for distributed search
• An effective near-optimal state-space search method: an application to a scheduling problem
• On commutativity based edge lean search
• Quantum branch-and-bound algorithm and its application to the travelling salesman problem
• Duality in permutation state spaces and the dual search algorithm
• Heuristic search. Theory and applications
• A single machine carryover sequence-dependent group scheduling in PCB manufacturing
• scientific article; zbMATH DE number 4164200 (Why is no real title available?)
• Algorithm of stable state spaces in reinforcement learning
• Extended beam search for non-exhaustive state space analysis

This page was built for publication: State-Space Search

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