Tabu search within a pivot and complement framework
From MaRDI portal
Recommendations
Cited in
(15)- A note on the pivot and complement heuristic for 0-1 programming problems
- The multidimensional 0-1 knapsack problem: an overview.
- 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
- Metaheuristics: A bibliography
- Mathematical programming based heuristics for the 0--1 MIP: a survey
- Integrating pivot based search with branch and bound for binary MIPs
- scientific article; zbMATH DE number 5282985 (Why is no real title available?)
- Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic
- scientific article; zbMATH DE number 1488077 (Why is no real title available?)
- Systematic reviews as a metaknowledge tool: caveats and a review of available options
- 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
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
This page was built for publication: Tabu search within a pivot and complement framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4888240)