Mixed integer programming formulations for the generalized traveling salesman problem with time windows

DOI10.1007/s10288-020-00461-yMaRDI QIDQ6057720

Yuan Yuan, Frédéric Semet, Diego Cattaruzza, Cyriaque Rousselot, Maxime Ogier

Publication date: 26 October 2023

Published in: 4OR (Search for Journal in Brave)

zbMATH Keywords

time windowsmixed integer programming formulationsgeneralized traveling salesman problemlast mile delivery

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items (1)

The cumulative school bus routing problem: Polynomial‐size formulations

Cites Work

• A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows
• A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
• A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows
• New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
• Integer Programming Formulation of Traveling Salesman Problems
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• Shortest-path network interdiction
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut

This page was built for publication: Mixed integer programming formulations for the generalized traveling salesman problem with time windows