Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem

DOI10.1007/978-3-030-91059-4_10MaRDI QIDQ6488350zbMATH OpenFDO

Authors M. Yu. Khachaĭ, Stanislav Ukolov, A. A. Petunin

Publication date 13 April 2023

Full work available at URL https://doi.org/10.1007/978-3-030-91059-4_10

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• PCGLNS: a heuristic solver for the precedence constrained generalized traveling salesman problem
• THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming
• Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin-Marsten bounding

Cites work

• scientific article; zbMATH DE number 3278972 (Why is no real title available?)
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
• A memetic algorithm for the generalized traveling salesman problem
• An Efficient Transformation Of The Generalized Traveling Salesman Problem
• An exact algorithm with linear complexity for a problem of visiting megalopolises
• Approximation schemes for the generalized traveling salesman problem
• Branch-and-Bound Strategies for Dynamic Programming
• Branch-and-bound for the precedence constrained generalized traveling salesman problem
• Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
• Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem
• Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
• GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
• Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
• On the complexity of dynamic programming for sequencing problems with precedence constraints
• PCGLNS: a heuristic solver for the precedence constrained generalized traveling salesman problem
• Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
• The Euclidean traveling salesman problem is NP-complete
• The geometric generalized minimum spanning tree problem with grid clustering
• The traveling salesman problem and its variations.

Cited in

(6)

• Fault-tolerant families of production plans: mathematical model, computational complexity, and branch-and-bound algorithms
• Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm
• THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM
• Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin-Marsten bounding
• PCGLNS: a heuristic solver for the precedence constrained generalized traveling salesman problem
• Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem

This page was built for publication: Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488350)