Solution‐based versus attribute‐based tabu search for binary integer programming

Tabu search is one of the most commonly used local search‐based metaheuristics. A key component of the search is the tabu criterion, which controls whether it should be prohibited to make certain moves relative to the current solution. While attribute‐based tabu criteria have been dominant for decad...

Full description

Bibliographic Details

Published in:	International transactions in operational research Vol. 32; no. 6; pp. 3780 - 3800
Main Authors:	Danielsen, Ketil, Hvattum, Lars Magnus
Format:	Journal Article
Language:	English
Published:	Oxford Blackwell Publishing Ltd 01.11.2025
Subjects:	0‐1 integer programming adaptive memory Algorithms binary optimization Criteria Heuristic Heuristic methods Integer programming Optimization tabu criterion Tabu search
ISSN:	0969-6016, 1475-3995
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!