Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search
type: Item
instance of: scholarly article
title: Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search
author: Wenda Zhang
author: Jason J. Sauppe
author: Sheldon H. Jacobson
published in: Computers \& Operations Research
publication date: 2021-05-21T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7350523
zbMATH Keywords: branch-and-bound algorithm
zbMATH Keywords: search strategies
zbMATH Keywords: cyclic best-first search
zbMATH Keywords: performance comparison
describes a project that uses: MIPLIB
MaRDI profile type: Publication
full work available at URL: j.cor.2020.105129
OpenAlex ID: W3097309452
cites work: Q5241193
cites work: Mixed Integer Programming: Analyzing 12 Years of Progress
cites work: The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
cites work: A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
cites work: Generalized best-first search strategies and the optimality of A*
cites work: Benchmarking optimization software with performance profiles.
cites work: A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
cites work: An Automatic Method of Solving Discrete Programming Problems
cites work: A Computational Study of Search Strategies for Mixed Integer Programming
cites work: An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
cites work: Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams
cites work: Cyclic best first search: Using contours to guide branch‐and‐bound algorithms
cites work: A branch, bound, and remember algorithm for the simple assembly line balancing problem
cites work: A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
cites work: Depth-First Search and Linear Graph Algorithms
cites work: Performance of linear-space search algorithms
DOI: 10.1016/J.COR.2020.105129
description: scientific article; zbMATH DE number 7350523