Keywords
HeuristicsTravelling salesman problemMathematical optimizationLocal search (optimization)Markov chainComputer scienceClass (philosophy)MathematicsSampling (signal processing)Artificial intelligenceMachine learning
Affiliated Institutions
Related Publications
Handbook of Genetic Algorithms
This book sets out to explain what genetic algorithms are and how they can be used to solve real-world problems. The first objective is tackled by the editor, Lawrence Davis. Th...
Performance evaluation of genetic algorithms for flowshop scheduling problems
The aim of this paper is to evaluate the performance of genetic algorithms for the flowshop scheduling problem with an objective of minimizing the makespan. First we examine var...
The Generalized A* Architecture
We consider the problem of computing a lightest derivation of a global structure using a set of weighted rules. A large variety of inference problems in AI can be formulated in ...
Feature selection for high-dimensional genomic microarray data
We report on the successful application of feature selection methods to a classification problem in molecular biology involving only 72 data points in a 7130 dimensional space. ...
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Scientists working with large volumes of high-dimensional data, such as global climate patterns, stellar spectra, or human gene distributions, regularly confront the problem of ...
Publication Info
- Year
- 1992
- Type
- article
- Volume
- 11
- Issue
- 4
- Pages
- 219-224
- Citations
- 199
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
199
OpenAlex
Cite This
Olivier Martin,
Steve W. Otto,
Edward W. Felten
(1992).
Large-step markov chains for the TSP incorporating local search heuristics.
Operations Research Letters
, 11
(4)
, 219-224.
https://doi.org/10.1016/0167-6377(92)90028-2
Identifiers
- DOI
- 10.1016/0167-6377(92)90028-2