Symmetric traveling salesman problems
DOI10.1016/0377-2217(90)90126-VzbMATH Open1403.90008OpenAlexW1967006921MaRDI QIDQ721684FDOQ721684
Authors: A. Volgenant 
Publication date: 19 July 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(90)90126-v
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Cites Work
- The Traveling-Salesman Problem and Minimum Spanning Trees
- A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
- Computer Solutions of the Traveling Salesman Problem
- The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
- Nonoptimal Edges for the Symmetric Traveling Salesman Problem
Cited In (9)
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
- SYMMETRIC ITINERARY SETS
- Lower bounding techniques for frequency assignment
- Title not available (Why is that?)
- Ordered spatial sampling by means of the traveling salesman problem
- Operational estimators for the length of a traveling salesman tour
- The maximum travelling salesman problem on symmetric Demidenko matrices
- Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks
- Exploiting planarity in separation routines for the symmetric traveling salesman problem
This page was built for publication: Symmetric traveling salesman problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q721684)
