Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm

Related Items (3)

Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule ⋮ FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM ⋮ Comparison and polyhedral properties of valid inequalities for a polytope of schedules for servicing identical requests

Cites Work

Unnamed Item
Unnamed Item
Load-dependent and precedence-based models for pickup and delivery problems
Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
The geometric generalized minimum spanning tree problem with grid clustering
On the complexity of dynamic programming for sequencing problems with precedence constraints
A memetic algorithm for the generalized traveling salesman problem
An inexact algorithm for the sequential ordering problem
The Euclidean traveling salesman problem is NP-complete
A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
Approximation schemes for the generalized traveling salesman problem
The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
The precedence-constrained asymmetric traveling salesman polytope
Branch-and-bound for the precedence constrained generalized traveling salesman problem
A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
An exact algorithm with linear complexity for a problem of visiting megalopolises
PCGLNS: a heuristic solver for the precedence constrained generalized traveling salesman problem
Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
Integer Programming Formulation of Traveling Salesman Problems
A Dynamic Programming Approach to Sequencing Problems
On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
Branch-and-Bound Strategies for Dynamic Programming
An Efficient Transformation Of The Generalized Traveling Salesman Problem
A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem
The symmetric generalized traveling salesman polytope
Multivalued Decision Diagrams for Sequencing Problems
Solution of a Large-Scale Traveling-Salesman Problem
On extended formulations for the precedence constrained asymmetric traveling salesman problem
Digraphs
Handbook of metaheuristics
The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints

This page was built for publication: Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm