Iterative state-space reduction for flexible computation

DOI10.1016/S0004-3702(00)00066-7zbMath0969.68137MaRDI QIDQ5940821

Weixiong Zhang

Publication date: 20 August 2001

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

Boolean satisfiabilitydepth-first branch-and-boundflexible computationheuristic searchstate-space reductiontraveling Salesman

Mathematics Subject Classification ID

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

Cites Work

• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• Depth-first iterative-deepening: An optimal admissible tree search
• A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
• Deliberation scheduling for problem solving in time-constrained environments
• An upper bound on the time complexity of iterative-deepening-\(A^*\)
• Searching for an optimal path in a tree with random costs
• Real-time heuristic search
• Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems
• Optimal composition of real-time systems
• Using branch-and-bound algorithms to obtain suboptimal solutions
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
• A Computing Procedure for Quantification Theory
• The traveling-salesman problem and minimum spanning trees: Part II
• Performance of linear-space search algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Iterative state-space reduction for flexible computation