Results for the close-enough traveling salesman problem with a branch-and-bound algorithm

DOI10.1007/s10589-023-00474-3zbMath1519.90215MaRDI QIDQ6097759

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

Publication date: 7 June 2023

Published in: Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

branch-and-bound algorithm; combinatorial optimization; computation; close-enough traveling salesman problem

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C27: Combinatorial optimization

Related Items

Facility location problems on graphs with non-convex neighborhoods

Cites Work

• Unnamed Item
• Unnamed Item
• A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
• A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem
• A novel discretization scheme for the close enough traveling salesman problem
• A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
• 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
• A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem
• An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
• A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
• Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem
• Cyclic best first search: Using contours to guide branch‐and‐bound algorithms
• An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints
• An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem
• Benchmarking optimization software with performance profiles.