Tabu search within a pivot and complement framework

DOI10.1016/0969-6016(94)90031-0zbMath0854.90102OpenAlexW2015861882MaRDI QIDQ4888240

Arne Løkketangen, Sverre Storøy, Kurt O. Jørnsten

Publication date: 19 January 1997

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0969-6016(94)90031-0

zbMATH Keywords

tabu search0-1 integer programspivot and complement heuristic

Mathematics Subject Classification ID

Integer programming (90C10) Boolean programming (90C09)

Related Items

Mathematical programming based heuristics for the 0--1 MIP: a survey, Metaheuristics: A bibliography, Systematic reviews as a metaknowledge tool: caveats and a review of available options, The multidimensional 0-1 knapsack problem: an overview., Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search, A computational study of parametric tabu search for 0-1 mixed integer programs, Solving zero-one mixed integer programming problems using tabu search, An efficient tabu search approach for the 0-1 multidimensional knapsack problem, Hybrid extreme point tabu search, The multidimensional 0-1 knapsack problem -- bounds and computational aspects