Branch-and-bound for the precedence constrained generalized traveling salesman problem

DOI10.1016/j.orl.2020.01.009OpenAlexW3005294261MaRDI QIDQ1984690

Raad Salman, Peter Damaschke, Fredrik Ekstedt

Publication date: 7 April 2020

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2020.01.009

zbMATH Keywords

branch-and-boundassignment problemprecedence constraintssequential ordering problemgeneralized traveling salesman problemminimum spanning arborescence problem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (3)

Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints ⋮ Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule ⋮ Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Load-dependent and precedence-based models for pickup and delivery problems
• Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
• Analysis of the Held-Karp lower bound for the asymmetric TSP
• A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
• A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
• The precedence-constrained asymmetric traveling salesman polytope
• An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers
• A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
• An Efficient Transformation Of The Generalized Traveling Salesman Problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
• On the generalized minimum spanning tree problem

This page was built for publication: Branch-and-bound for the precedence constrained generalized traveling salesman problem