Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search

DOI10.1016/j.cor.2020.105129OpenAlexW3097309452MaRDI QIDQ2026990

Jason J. Sauppe, Wenda Zhang, Jacobson, Sheldon H.

Publication date: 21 May 2021

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2020.105129

zbMATH Keywords

branch-and-bound algorithmperformance comparisonsearch strategiescyclic best-first search

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• MIPLIB

Cites Work

• Unnamed Item
• A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
• A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
• An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
• Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams
• A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem
• A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
• An Automatic Method of Solving Discrete Programming Problems
• Generalized best-first search strategies and the optimality of A*
• A Computational Study of Search Strategies for Mixed Integer Programming
• Cyclic best first search: Using contours to guide branch‐and‐bound algorithms
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
• Mixed Integer Programming: Analyzing 12 Years of Progress
• Depth-First Search and Linear Graph Algorithms
• Performance of linear-space search algorithms
• Benchmarking optimization software with performance profiles.

This page was built for publication: Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search