Exponential extrapolation memory for tabu search

DOI10.1016/j.ejco.2022.100028zbMath1530.90113WikidataQ115575556 ScholiaQ115575556MaRDI QIDQ6114931

Håkon Bentsen, Lars Magnus Hvattum, Arild Hoff

Publication date: 12 July 2023

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

zbMATH Keywords

tabu search0-1 integer programmingadaptive memorybinary optimization

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Boolean programming (90C09)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A heuristic for Boolean optimization problems
• Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
• Adaptive memory search for Boolean optimization problems
• Measuring the impact of primal heuristics
• Adaptive memory search for multidemand multidimensional knapsack problems
• A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem
• Advanced Scatter Search for the Max-Cut Problem
• Randomized heuristics for the Max-Cut problem
• A Spectral Bundle Method for Semidefinite Programming
• A unified tabu search heuristic for vehicle routing problems with time windows

This page was built for publication: Exponential extrapolation memory for tabu search