Best-so-far vs. where-you-are: Implications for optimal finite-time annealing
type: Item
instance of: scholarly article
title: Best-so-far vs. where-you-are: Implications for optimal finite-time annealing
zbMATH Open document ID: 0791.90048
DOI: 10.1016/0167-6911(94)90028-0
author: Kenneth D. Boese
author: Andrew B. Kahng
published in: Systems \& Control Letters
publication date: 1994-04-19T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 550116
zbMATH Keywords: traveling salesman
zbMATH Keywords: graph bisection
zbMATH Keywords: simulated annealing
zbMATH Keywords: heuristic global optimization
zbMATH Keywords: monotone cooling schedules
zbMATH Keywords: hill-climbing
describes a project that uses: TimberWolf
MaRDI profile type: Publication
full work available at URL: 0167-6911(94)90028-0
OpenAlex ID: W1964440694
cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
cites work: Q4198056
cites work: Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
cites work: Cooling Schedules for Optimal Annealing
cites work: Simulated annealing - to cool or not
cites work: Q4038710
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
cites work: Optimization by Simulated Annealing
cites work: Q3785827
cites work: Simulated annealing, random search, MultiStart or SAD?
cites work: Q5187226
cites work: Q3997942
cites work: Convergence of an annealing algorithm
cites work: Efficient simulated annealing on fractal energy landscapes
cites work: Analysis of finite length annealing schedules
description: scientific article; zbMATH DE number 550116