Depth-m search in branch-and-bound algorithms

DOI10.1007/BF00991818zbMath0406.68032OpenAlexW2026798072MaRDI QIDQ4192965

Toshihide Ibaraki

Publication date: 1978

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00991818

zbMATH Keywords

Mathematical ProgrammingComputational ComplexityDepth-First-SearchBranch-And-Bound AlgorithmHeuristic Search

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Mathematical programming (90C99) Algorithms in computer science (68W99)

Related Items (5)

Knowledge versus search: a quantitative analysis using A* ⋮ Heuristic search in restricted memory ⋮ Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization ⋮ The set union problem with dynamic weighted backtracking ⋮ Proof-number search

Cites Work

• Unnamed Item
• A Flexible Enumeration Scheme for Zero-One Programming
• Theoretical comparisons of search strategies in branch-and-bound algorithms
• Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
• Branch-and-Bound Methods: A Survey
• Accelerating List Processing in Discrete Programming
• Technical Note—A Flexible Tree-Search Method for Integer Programming Problems
• Branch-and-Bound Methods: General Formulation and Properties

This page was built for publication: Depth-m search in branch-and-bound algorithms