1993•Lecture notes in economics and mathematical systemsRequires access

A Computational Comparison of Simulated Annealing and Tabu Search Applied to the Quadratic Assignment Problem

Jan Paulli

Open publisher page 16 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 16 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Tabu search, Simulated annealing, Guided Local Search, Quadratic equation, Mathematical optimization, Quadratic assignment problem, Hill climbing, Computer science

Back to paper search Browse research topics Original source

A Computational Comparison of Simulated Annealing and Tabu Search Applied to the Quadratic Assignment Problem — Research Paper | ScholarLens