Dynamic tabu search strategies for the traveling purchaser problem
type: Item
instance of: scholarly article
title: Dynamic tabu search strategies for the traveling purchaser problem
zbMATH Open document ID: 0851.90133
DOI: 10.1007/BF02125457
author: Stefan Voß
published in: Annals of Operations Research
publication date: 1996-07-28T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 910207
zbMATH Keywords: tabu search
zbMATH Keywords: traveling purchaser problem
zbMATH Keywords: metastrategy
zbMATH Keywords: dynamic strategies
zbMATH Keywords: reverse elimination method
zbMATH Keywords: cancellation sequence method
zbMATH Keywords: simulated annealing
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Technical Note—On the Cancellation Sequence Method of Tabu Search
cites work: Dynamic tabu list management using the reverse elimination method
cites work: Q4198056
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: A user's guide to tabu search
cites work: Heuristics for the capacitated plant location model
cites work: Large-scale controlled rounding using tabu search with strategic oscillation
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Approximate algorithms for the travelling purchaser problem
cites work: Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
cites work: Capacitated clustering problems by hybrid simulated annealing and tabu search
cites work: Travelling purchaser problem
cites work: Q4835606
full work available at URL: https://doi.org/10.1007/bf02125457
OpenAlex ID: W2160968871
description: scientific article; zbMATH DE number 910207