Estimating optimal objective values for the TSP, VRP, and other combinatorial problems using randomization
From MaRDI portal
Publication:6495409
DOI10.1111/ITOR.13260MaRDI QIDQ6495409FDOQ6495409
Shuhan Kou, Stefan Poikonen, Bruce Golden
Publication date: 30 April 2024
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Cites Work
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- TSPLIB—A Traveling Salesman Problem Library
- Linear-Time Approximation for Maximum Weight Matching
- Title not available (Why is that?)
- Operational estimators for the length of a traveling salesman tour
- Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks
- A distribution-free TSP tour length estimation model for random graphs
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- Random tours in the traveling salesman problem: Analysis and application
- An optimal minimum spanning tree algorithm
- Total distance approximations for routing solutions
- Hard to solve instances of the Euclidean traveling salesman problem
- Optimal TSP tour length estimation using standard deviation as a predictor
- New benchmark instances for the capacitated vehicle routing problem
- Computing the variance of tour costs over the solution space of the TSP in polynomial time
This page was built for publication: Estimating optimal objective values for the TSP, VRP, and other combinatorial problems using randomization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6495409)
