Synchronized Traveling Salesman Problem

DOI10.7155/jgaa.00566zbMath1489.05086arXiv2012.00311OpenAlexW3200246913MaRDI QIDQ5084688

József Varnyú, Gyula Pap

Publication date: 28 June 2022

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Uses Software

• VRP

Cites Work

• Pebble game algorithms and sparse graphs
• The Quickest Transshipment Problem
• Finding 2-Factors Closer to TSP Tours in Cubic Graphs
• An Introduction to Network Flows over Time
• A Novel Approach to Solve Multiple Traveling Salesmen Problem by Genetic Algorithm
• The prize collecting traveling salesman problem
• The dynamic transportation problem: A survey
• A Cutting Planes Algorithm for the m-Salesmen Problem
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Constructing Maximal Dynamic Flows from Static Flows

This page was built for publication: Synchronized Traveling Salesman Problem