Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule

Cites Work

Unnamed Item
Unnamed Item
Network repair crew scheduling and routing for emergency relief distribution problem
Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
Stochastic network models for logistics planning in disaster relief
Load-dependent and precedence-based models for pickup and delivery problems
The hierarchical traveling salesman problem
Natural and extended formulations for the time-dependent traveling salesman problem
Solving the family traveling salesman problem
Strong multi-commodity flow formulations for the asymmetric traveling salesman problem
A comparative analysis of several asymmetric traveling salesman problem formulations
Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
An inexact algorithm for the sequential ordering problem
Layered graph approaches for combinatorial optimization problems
The vehicle routing problem with service level constraints
A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration
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
A simple and effective metaheuristic for the minimum latency problem
Branch-and-bound for the precedence constrained generalized traveling salesman problem
Comparison of formulations for the inventory routing problem
Decomposition-based algorithms for the crew scheduling and routing problem in road restoration
A transformation technique for the clustered generalized traveling salesman problem with applications to logistics
Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics
Priority-based assignment and routing of a fleet of unmanned combat aerial vehicles
A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints
Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
Priority Assignment in Emergency Response
Integer Programming Formulation of Traveling Salesman Problems
TSPLIB—A Traveling Salesman Problem Library
Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem
An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
Multivalued Decision Diagrams for Sequencing Problems
Solution of a Large-Scale Traveling-Salesman Problem
Humanitarian aid logistics: supply chain management in high gear
Benchmarking optimization software with performance profiles.
Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm

This page was built for publication: Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule