A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows

DOI10.1016/j.orl.2020.01.008OpenAlexW3005757297MaRDI QIDQ1984692

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

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.008

zbMATH Keywords

time windowsrouting problemssubtour elimination constraintsMiller-Tucker-Zemlin

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (2)

Mixed integer programming formulations for the generalized traveling salesman problem with time windows ⋮ A branch-and-cut algorithm for the generalized traveling salesman problem with time windows

Uses Software

• VRP

Cites Work

• A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
• Vehicle Routing
• Shortest-path network interdiction
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• Solution of a Large-Scale Traveling-Salesman Problem

This page was built for publication: A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows