Total distance approximations for routing solutions
type: Item
instance of: scholarly article
title: Total distance approximations for routing solutions
zbMATH Open document ID: 1458.90557
author: Y. Aharonov
published in: Computers \& Operations Research
publication date: 2018-12-03T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6988144
zbMATH Keywords: distance estimation
zbMATH Keywords: routing problems
zbMATH Keywords: regression
MaRDI profile type: Publication
full work available at URL: j.cor.2018.10.008
OpenAlex ID: W2896636205
cites work: New route relaxation and pricing strategies for the vehicle routing problem
cites work: An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem
cites work: Q5729634
cites work: A distribution-free TSP tour length estimation model for random graphs
cites work: Operational estimators for the length of a traveling salesman tour
cites work: Modeling Distribution Problems with Time Windows: Part I
cites work: Multidepot pickup and delivery problems in multiple regions: a typology and integrated model
cites work: Continuous approximation models in freight distribution management
cites work: Request evaluation strategies for carriers in auction-based collaborations
cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic
cites work: Models to estimate average route lengths in different geographical environments
cites work: Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: An Asymptotic, Probabilistic Analysis of a Routing Problem
cites work: Looking ahead with the pilot method
DOI: 10.1016/J.COR.2018.10.008
description: scientific article; zbMATH DE number 6988144