Fairer comparisons for travelling salesman problem solutions using hash functions
From MaRDI portal
Publication:6149082
Cites work
- scientific article; zbMATH DE number 1668689 (Why is no real title available?)
- scientific article; zbMATH DE number 2130220 (Why is no real title available?)
- scientific article; zbMATH DE number 3240945 (Why is no real title available?)
- A method for solving traveling-salesman problems
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
- A survey for the quadratic assignment problem
- Assignment Problems and the Location of Economic Activities
- Combinatorial generation via permutation languages
- Hashing vectors for tabu search
- Heuristics for vehicle routing problems: sequence or set optimization?
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other
- Scheduling algorithms
- Stochastic local search. Foundations and applications.
- TSPLIB—A Traveling Salesman Problem Library
- The traveling-salesman problem
- Wilcoxon-Mann-Whitney or t-test? On assumptions for hypothesis tests and multiple interpretations of decision rules
This page was built for publication: Fairer comparisons for travelling salesman problem solutions using hash functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6149082)