Estimating optimal objective values for the TSP, VRP, and other combinatorial problems using randomization

DOI10.1111/ITOR.13260MaRDI QIDQ6495409

Shuhan Kou, Stefan Poikonen, Bruce L. Golden

Publication date: 30 April 2024

Published in: International Transactions in Operational Research (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationtraveling salesman problemvehicle routing problemregression

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• A distribution-free TSP tour length estimation model for random graphs
• Operational estimators for the length of a traveling salesman tour
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Total distance approximations for routing solutions
• New benchmark instances for the capacitated vehicle routing problem
• Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks
• Computing the variance of tour costs over the solution space of the TSP in polynomial time
• Hard to solve instances of the Euclidean traveling salesman problem
• Optimal TSP tour length estimation using standard deviation as a predictor
• Linear-Time Approximation for Maximum Weight Matching
• An optimal minimum spanning tree algorithm
• TSPLIB—A Traveling Salesman Problem Library
• A minimum spanning tree algorithm with inverse-Ackermann type complexity
• Random tours in the traveling salesman problem: Analysis and application

This page was built for publication: Estimating optimal objective values for the TSP, VRP, and other combinatorial problems using randomization