The intermittent travelling salesman problem

DOI10.1111/itor.12609OpenAlexW2899162938MaRDI QIDQ6066722

Patrick de Causmaecker, Tu-San Pham, Pieter Leyman

Publication date: 16 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12609

zbMATH Keywords

branch-and-boundvariable neighbourhood searchintermittent travelling salesman problem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Variable neighbourhood search: methods and applications
• Variable neighbourhood search: Methods and applications
• The traveling salesman problem: An overview of exact and approximate algorithms
• Variable neighborhood search
• Record breaking optimization results using the ruin and recreate principle
• TSPLIB—A Traveling Salesman Problem Library
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• A Method for Solving Traveling-Salesman Problems
• Computer Solutions of the Traveling Salesman Problem

This page was built for publication: The intermittent travelling salesman problem