A local search template.
type: Item
instance of: scholarly article
title: A local search template.
zbMATH Open document ID: 1040.90542
DOI: 10.1016/S0305-0548(97)00093-2
author: R. J. M. Vaessens
author: E. Aarts
author: Jan Karel Lenstra
published in: Computers \& Operations Research
publication date: 2003-09-07T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 1975815
zbMATH Keywords: local search
zbMATH Keywords: iterative improvement
zbMATH Keywords: simulated annealing
zbMATH Keywords: threshold accepting
zbMATH Keywords: tabu search
zbMATH Keywords: genetic algorithms
MaRDI profile type: Publication
cites work: Q3994799
cites work: Q4339078
cites work: A Method for Solving Traveling-Salesman Problems
cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
cites work: Q4198056
cites work: Tabu Search—Part I
cites work: Q4692508
cites work: Q4079017
cites work: Q4365133
cites work: How easy is local search?
cites work: Optimization by Simulated Annealing
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Q3981972
cites work: Q4739657
cites work: Q4365128
cites work: Job Shop Scheduling by Local Search
cites work: Q4365127
cites work: Q3975934
full work available at URL: s0305-0548(97)00093-2
OpenAlex ID: W2087594839
description: scientific article; zbMATH DE number 1975815