Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic
From MaRDI portal
Publication:4291502
DOI10.1287/IJOC.6.1.82zbMATH Open0798.90105OpenAlexW2068939774MaRDI QIDQ4291502FDOQ4291502
Authors: Ronny Aboudi, Kurt Jörnsten 
Publication date: 10 May 1994
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.6.1.82
Recommendations
Cited In (18)
- Tabu search within a pivot and complement framework
- A note on the pivot and complement heuristic for 0-1 programming problems
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
- Mathematical programming based heuristics for the 0--1 MIP: a survey
- Scatter search and star-paths: Beyond the genetic metaphor
- Title not available (Why is that?)
- Hybrid extreme point tabu search
- Matheuristics: survey and synthesis
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Integrating pivot based search with branch and bound for binary MIPs
- Extension of reverse elimination method through a dynamic management of the tabu list
- The multidimensional 0-1 knapsack problem: an overview.
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- Solving zero-one mixed integer programming problems using tabu search
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- General purpose heuristics for integer programming. I
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
This page was built for publication: Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291502)
