Technical Note—A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges
From MaRDI portal
Publication:4170533
DOI10.1287/opre.25.5.871zbMath0388.90054OpenAlexW2153142800MaRDI QIDQ4170533
Saman Hong, Manfred W. Padberg
Publication date: 1977
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.25.5.871
Programming involving graphs or networks (90C35) Integer programming (90C10) Applications of graph theory to circuits and networks (94C15)
Related Items
Hybrid search with neighborhood reduction for the multiple traveling salesman problem, Memetic search for the minmax multiple traveling salesman problem with single and multiple depots, An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem, The multiple-robot assembly plan problem, Genetic algorithm for combinatorial path planning: the subtour problem, The multiagent planning problem, On the symmetric travelling salesman problem I: Inequalities, On the symmetric travelling salesman problem II: Lifting theorems and facets, An algorithm for mapping the asymmetric multiple traveling salesman problem onto colored Petri nets
