Standout Papers

An Effective Heuristic Algorithm for the Traveling-Salesman Problem 1973 2026 1990 2008 2.0k
  1. An Effective Heuristic Algorithm for the Traveling-Salesman Problem (1973)
    Simon Lin, Brian W. Kernighan Operations Research

Citation Impact

Citing Papers

On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment
2017 Standout
An Investigation of Some Properties of an Ant Algorithm
1992
Distributed Genetic Algorithms
1989
Distributed Optimization by Ant Colonies
1992
Optimization by simulated annealing: Quantitative studies
1984 Standout
A Novel Approach to Decoy Set Generation: Designing a Physical Energy Function Having Local Minima with Native Structure Characteristics
2003 StandoutNobel
Development and validation of a genetic algorithm for flexible docking 1 1Edited by F. E. Cohen
1997 Standout
A tension-based theory of morphogenesis and compact wiring in the central nervous system
1997 StandoutNature
Functional cartography of complex metabolic networks
2005 StandoutNature
Effects of a Bulk Perturbation on the Ground State of 3D Ising Spin Glasses
2001 StandoutNobel
Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
1984 Standout
The dual role of fragments in fragment‐assembly methods for de novo protein structure prediction
2011 StandoutNobel
Improved protein structure prediction using potentials from deep learning
2020 StandoutNatureNobel
MOLMOL: A program for display and analysis of macromolecular structures
1996 StandoutNobel
AutoDock Vina: Improving the speed and accuracy of docking with a new scoring function, efficient optimization, and multithreading
2009 Standout
Probing Protein Fold Space with a Simplified Model
2007 StandoutNobel
Survey of Clustering Algorithms
2005 Standout
Ant system: optimization by a colony of cooperating agents
1996 Standout
Capacitated clustering problems by hybrid simulated annealing and tabu search
1994
Heuristics from Nature for Hard Combinatorial Optimization Problems
1996
Spin glasses: Experimental facts, theoretical concepts, and open questions
1986 Standout
Applying the genetic approach to simulated annealing in solving some NP-hard problems
1993
Variable neighborhood search: Principles and applications
2001 Standout
Computing with Neural Circuits: A Model
1986 StandoutScienceNobel
Transition to Clean Technology
2016 StandoutNobel
Identifying cohesive subgroups
1995
Complex adaptive systems: Exploring the known, the unknown and the unknowable
2002
Metaheuristics: A bibliography
1996
Computer Simulation of Liquids
2017 Standout
Escaping free-energy minima
2002 Standout
Recent advances in magnetic structure determination by neutron powder diffraction
1993 Standout
Dynamic tabu search strategies for the traveling purchaser problem
1996
Accelerated branch exchange heuristics for symmetric traveling salesman problems
1987
Parallel visual computation
1983 StandoutNatureNobel
Unified Approach for Molecular Dynamics and Density-Functional Theory
1985 Standout
The traveling salesman problem: An overview of exact and approximate algorithms
1992
Brain, neural networks, and computation
1999 StandoutNobel
An Analysis of Several Heuristics for the Traveling Salesman Problem
1977
Solution of large-scale symmetric travelling salesman problems
1991
Trajectories of the Earth System in the Anthropocene
2018 Standout
Complex networks: Structure and dynamics
2006 Standout
Neural computation by concentrating information in time.
1987 StandoutNobel
Dynamic weighting in Monte Carlo and optimization
1997
Ant colony system: a cooperative learning approach to the traveling salesman problem
1997 Standout
Crystallographic R Factor Refinement by Molecular Dynamics
1987 StandoutScience
Local Search for the Asymmetric Traveling Salesman Problem
1980
On the Significance of the Initial Solution in Travelling Salesman Heuristics
1994
Iterative minimization techniques forab initiototal-energy calculations: molecular dynamics and conjugate gradients
1992 Standout
Defining and detecting quantum speedup
2014 StandoutScienceNobel
A Global Geometric Framework for Nonlinear Dimensionality Reduction
2000 StandoutScience
Numerical Study of Order in a Gauge Glass Model
1998 StandoutNobel
Distances between traveling salesman tours
1995
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
1991
Effects of changing the boundary conditions on the ground state of Ising spin glasses
2000 StandoutNobel
Optimization by Simulated Annealing
1983 StandoutScience
Renormalization for Discrete Optimization
1999
Multidimensional Scaling, Tree-Fitting, and Clustering
1980 StandoutScience
Grey Wolf Optimizer
2014 Standout
Large-step markov chains for the TSP incorporating local search heuristics
1992
Numerical Study of Spin and Chiral Order in a Two-DimensionalXYSpin Glass
1999 StandoutNobel
The modularity of pollination networks
2007 Standout
Variable neighborhood search
1997 Standout
A modified Lin-Kernighan traveling-salesman heuristic
1993
Capacity Limits of Optical Fiber Networks
2010 Standout
Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
1990 Standout
Optimization of a 532-city symmetric traveling salesman problem by branch and cut
1987
“Neural” computation of decisions in optimization problems
1985 StandoutNobel
Some Examples of Difficult Traveling Salesman Problems
1978
Canonical sampling through velocity rescaling
2007 Standout
Clustering by fast search and find of density peaks
2014 StandoutScience
Neurons with graded response have collective computational properties like those of two-state neurons.
1984 StandoutNobel
An analogue approach to the travelling salesman problem using an elastic net method
1987 StandoutNature
Probabilistic exchange algorithms and Euclidean traveling salesman problems
1986
An effective implementation of the Lin–Kernighan traveling salesman heuristic
2000 Standout
Large-step Markov chains for the Traveling Salesman Problem
2018
APPLYING EVOLUTIONARY PROGRAMMING TO SELECTED TRAVELING SALESMAN PROBLEMS
1993
Automated docking using a Lamarckian genetic algorithm and an empirical binding free energy function
1998 Standout
Exact Solution of Large Asymmetric Traveling Salesman Problems
1991 Science
The Euclidean travelling salesman problem is NP-complete
1977
Numerical Study of a Superconducting Glass Model
1997 StandoutNobel
Completely nonmetric multidimensional scaling
1978

Works of Simon Lin being referenced

Heuristic Programming as an Aid to Network Design
1975
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
1973 Standout
Nearest-neighbour heuristics in accelerated algorithms of optimisation problems
1994
Heuristic Solution of a Signal Design Optimization Problem
1973
Rankless by CCL
2026