Local search with memory: Benchmarking RTS
type: Item
instance of: scholarly article
title: Local search with memory: Benchmarking RTS
zbMATH Open document ID: 0843.90094
DOI: 10.1007/BF01719249
author: Roberto Battiti
author: Giampietro Tecchiolli
published in: OR Spektrum
publication date: 1996-03-07T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 853140
zbMATH Keywords: reactive tabu search method
zbMATH Keywords: multiknapsack problem
zbMATH Keywords: repeated local minima search
zbMATH Keywords: simulated annealing
zbMATH Keywords: genetic algorithms
zbMATH Keywords: neural networks
MaRDI profile type: Publication
cites work: Q3994799
cites work: The Reactive Tabu Search
cites work: Simulated annealing and tabu search in the long run: A comparison on QAP tasks
cites work: Probabilistic asymptotic properties of some combinatorial optimization problems
cites work: Bounding the probability of success of stochastic methods for global optimization
cites work: An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
cites work: Q4198056
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Q4692508
cites work: Q4079017
cites work: ``Neural'' computation of decisions in optimization problems
cites work: Optimization by Simulated Annealing
cites work: Q4057549
cites work: The parallel genetic algorithm as function optimizer
cites work: Q3993418
cites work: Dynamic tabu list management using the reverse elimination method
cites work: Hashing vectors for tabu search
cites work: Correlated and uncorrelated fitness landscapes and how to tell the difference
cites work: On the stability of the travelling salesman problem algorithm of Hopfield and Tank
cites work: Tabu search techniques. A tutorial and an application to neural networks
description: scientific article; zbMATH DE number 853140