Simulated annealing and tabu search: Lessons from a line search
type: Item
instance of: scholarly article
title: Simulated annealing and tabu search: Lessons from a line search
zbMATH Open document ID: 0813.90100
DOI: 10.1016/0305-0548(94)90013-2
author: David L. Woodruff
published in: Computers \& Operations Research
publication date: 1995-01-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 709970
zbMATH Keywords: near optimal solutions
zbMATH Keywords: simulated annealing
zbMATH Keywords: tabu search
zbMATH Keywords: line search
MaRDI profile type: Publication
full work available at URL: 0305-0548(94)90013-2
OpenAlex ID: W2072199923
cites work: Some theoretical implications of local optimization
cites work: Q4038710
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
cites work: Tabu Search—Part I
cites work: The tabu search metaheuristic: How we used it
cites work: Q3994799
cites work: Q3785827
cites work: Cooling Schedules for Optimal Annealing
cites work: Convergence of an annealing algorithm
cites work: Q3671491
cites work: Tabu Search—Part II
cites work: Extensions of a tabu search adaptation to the quadratic assignment problem
cites work: Hashing vectors for tabu search
description: scientific article; zbMATH DE number 709970