DOIAbstract
AbstractTwo metrics, based respectively on k-OPT and 2-OPT, for measuring the distance between traveling salesman tours are considered and their relationship worked out
AbstractTwo metrics, based respectively on k-OPT and 2-OPT, for measuring the distance between traveling salesman tours are considered and their relationship worked out
In the literature on judgment aggregation, an important open question is how to measure the distance...
Rosenkrantz et al. (SIAM J. Comput. 6 (1977) 563) and Johnson and Papadimitriou (in: E.L. Lawler, J....
Many learning algorithms rely on distance metrics to receive their input data. Research has shown th...
AbstractTwo metrics, based respectively on k-OPT and 2-OPT, for measuring the distance between trave...
As a first contribution the mTSP is solved using an exact method and two heuristics, where the numbe...
Comparison of average relative distance error for traveling salesman problems.</p
These are the instances used in the article titled 'Estimating the Tour Length for the Close Enough ...
Estimating the solution value of transportation problems can be useful to assign customers to days f...
We construct empirically based regression models for estimating the tour length in the Close Enough ...
This article investigates the selection of a distance measure in location modeling. While in the emp...
Given N points in some General metric space M, we want to connect them so that from each point we ca...
© 2017 Elsevier B.V. The analysis of clustering and correlation between points on a linear network, ...
Kuala Lumpur is a cosmopolitan urban centre of Malaysia and has received more than 11 million touris...
In this thesis we investigate linear and semidefinite programming approximations for the Traveling S...
Many problems in operations research and in economics reduce to the finding of one or more points mi...
In the literature on judgment aggregation, an important open question is how to measure the distance...
Rosenkrantz et al. (SIAM J. Comput. 6 (1977) 563) and Johnson and Papadimitriou (in: E.L. Lawler, J....
Many learning algorithms rely on distance metrics to receive their input data. Research has shown th...
AbstractTwo metrics, based respectively on k-OPT and 2-OPT, for measuring the distance between trave...
As a first contribution the mTSP is solved using an exact method and two heuristics, where the numbe...
Comparison of average relative distance error for traveling salesman problems.</p
These are the instances used in the article titled 'Estimating the Tour Length for the Close Enough ...
Estimating the solution value of transportation problems can be useful to assign customers to days f...
We construct empirically based regression models for estimating the tour length in the Close Enough ...
This article investigates the selection of a distance measure in location modeling. While in the emp...
Given N points in some General metric space M, we want to connect them so that from each point we ca...
© 2017 Elsevier B.V. The analysis of clustering and correlation between points on a linear network, ...
Kuala Lumpur is a cosmopolitan urban centre of Malaysia and has received more than 11 million touris...
In this thesis we investigate linear and semidefinite programming approximations for the Traveling S...
Many problems in operations research and in economics reduce to the finding of one or more points mi...
In the literature on judgment aggregation, an important open question is how to measure the distance...
Rosenkrantz et al. (SIAM J. Comput. 6 (1977) 563) and Johnson and Papadimitriou (in: E.L. Lawler, J....
Many learning algorithms rely on distance metrics to receive their input data. Research has shown th...
Add to ORKG