State-Space Search

DOI10.1007/978-1-4612-1538-7zbMath0942.90001OpenAlexW2499366559MaRDI QIDQ4939497

Weixiong Zhang

Publication date: 6 February 2000

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

zbMATH Keywords

combinatorial optimizationbranch and boundtravelling salesman problemstate space search

Mathematics Subject Classification ID

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

Related Items (4)

Nagging: A scalable fault-tolerant paradigm for distributed search ⋮ A single machine carryover sequence-dependent group scheduling in PCB manufacturing ⋮ Extended beam search for non-exhaustive state space analysis ⋮ Quantum branch-and-bound algorithm and its application to the travelling salesman problem

This page was built for publication: State-Space Search