A construction for directed in-out subgraphs of optimal size

zbMath1405.05068arXiv1702.03075MaRDI QIDQ4622626

David G. Glynn, Michael Haythorpe, Asghar Moeini

Publication date: 13 February 2019

Full work available at URL: https://arxiv.org/abs/1702.03075

zbMATH Keywords

traveling salesman problem\(k\)-in-out graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

A transformation technique for the clustered generalized traveling salesman problem with applications to logistics ⋮ Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples

Uses Software

• LKH
• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
• Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem
• An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs
• A model for warehouse order picking
• Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• An Efficient Transformation Of The Generalized Traveling Salesman Problem
• Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples

This page was built for publication: A construction for directed in-out subgraphs of optimal size