Pages that link to "Item:Q1905084"
From MaRDI portal
The following pages link to Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks (Q1905084):
Displaying 14 items.
- A distribution-free TSP tour length estimation model for random graphs (Q319156) (← links)
- The effects of a new selection operator on the performance of a genetic algorithm (Q544067) (← links)
- Total distance approximations for routing solutions (Q1628118) (← links)
- Continuous approximation models in freight distribution management (Q1688432) (← links)
- The dynamic-demand joint replenishment problem with approximated transportation costs (Q1734353) (← links)
- Data-driven optimization and statistical modeling to improve meter reading for utility companies (Q2147136) (← links)
- A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution (Q2178337) (← links)
- A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
- Optimal TSP tour length estimation using standard deviation as a predictor (Q2676394) (← links)
- Using regression models to understand the impact of route-length variability in practical vehicle routing (Q2679006) (← links)
- Dividing a Territory Among Several Vehicles (Q2815468) (← links)
- Using an \(A^\ast\)-based framework for decomposing combinatorial optimization problems to employ NISQ computers (Q6048724) (← links)
- Continuous approximation formulas for location problems (Q6085881) (← links)
- Estimating optimal objective values for the TSP, VRP, and other combinatorial problems using randomization (Q6495409) (← links)
