Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization

DOI10.1007/BF02564831zbMath0969.65052MaRDI QIDQ1592632

Albert Corominas, Rafael Pastor

Publication date: 25 January 2001

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

branch-and-bound algorithmcombinatorial optimizationartificial intelligenceselection strategy

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (2)

A proposal for a hybrid meta-strategy for combinatorial optimization problems ⋮ Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems.

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Linear-space best-first search
• Depth-first iterative-deepening: An optimal admissible tree search
• Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
• On the complexity of admissible search algorithms
• Agent searching in a tree and the optimality of iterative deepening
• A new node selection strategy in the branch-and-bound procedure
• Heuristic search viewed as path finding in a graph
• Database Location in Computer Networks
• Theoretical comparisons of search strategies in branch-and-bound algorithms
• Depth-m search in branch-and-bound algorithms
• Performance of linear-space search algorithms

This page was built for publication: Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization