On the generalized 2-peripatetic salesman problem

DOI10.1016/0377-2217(94)90159-7zbMath0806.90122OpenAlexW2169545719MaRDI QIDQ1328613

A. Volgenant, Jeroen B. J. M. De Kort

Publication date: 26 July 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90159-7

zbMATH Keywords

undirected graphedge-disjoint Hamiltonian cycles2-peripatetic salesman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Safe and secure vehicle routing: a survey on minimization of risk exposure, Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Transforming asymmetric into symmetric traveling salesman problems
• On Some Generalizations of the Travelling-Salesman Problem
• Improved Time Bounds for the Maximum Flow Problem
• Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
• An Efficient Transformation Of The Generalized Traveling Salesman Problem
• A branch-and-bound algorithm for flow-path design of automated guided vehicle systems
• The Routing Problem with “K” Specified Nodes
• Lower bounds for symmetricK-peripatetic salesman problems