A note on computational aspects of the Steiner traveling salesman problem

DOI10.1111/itor.12592OpenAlexW2891500134MaRDI QIDQ6066594

Markus Sinnl, Eduardo Álvarez-Miranda

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.12592

zbMATH Keywords

Steiner tree problemtraveling salesman problemcomputational studyproblem transformation

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (3)

Vehicle routing on road networks: how good is Euclidean approximation? ⋮ Improving a constructive heuristic for the general routing problem ⋮ An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Compact formulations of the Steiner traveling salesman problem and related problems
• Distance conserving reductions for nonoriented networks
• A cutting plane procedure for the travelling salesman problem on road networks
• Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
• The traveling salesman problem and its variations
• Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs
• The traveling salesman problem on a graph and some related integer polyhedra
• Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph
• A fundamental problem in vehicle routing
• Dynamic programming and the graphical traveling salesman problem
• A GRASP heuristic using path‐relinking and restarts for the Steiner traveling salesman problem
• In Pursuit of the Traveling Salesman
• A cutting plane algorithm for the general routing problem

This page was built for publication: A note on computational aspects of the Steiner traveling salesman problem