Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods
From MaRDI portal
Publication:4869757
DOI10.1287/ijoc.7.4.417zbMath0843.90099OpenAlexW2079782414MaRDI QIDQ4869757
No author found.
Publication date: 19 August 1996
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.7.4.417
global optimizationsimulated annealingnon-monotonethreshold acceptanceself-tuningsymmetric travelling salesmanold bachelor acceptancestochastic hill-climbing
Related Items (8)
An overview of graph covering and partitioning ⋮ Political districting: from classical models to recent approaches ⋮ The late acceptance hill-climbing heuristic ⋮ Comparing different metaheuristic approaches for the median path problem with bounded length ⋮ Revisiting simulated annealing: a component-based analysis ⋮ Political districting: From classical models to recent approaches ⋮ Local search algorithms for political districting ⋮ Predatory search algorithm with restriction of solution distance
This page was built for publication: Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods
