An efficient tabu search approach for the 0-1 multidimensional knapsack problem
type: Item
instance of: scholarly article
title: An efficient tabu search approach for the 0-1 multidimensional knapsack problem
zbMATH Open document ID: 0991.90089
DOI: 10.1016/S0377-2217(97)00296-8
author: Saïd Hanafi
author: Arnaud Fréville
published in: European Journal of Operational Research
publication date: 2002-08-18T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 1782830
zbMATH Keywords: tabu search
zbMATH Keywords: 0-1 multidimensional knapsack
zbMATH Keywords: strategic oscillation
zbMATH Keywords: surrogate duality
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic
cites work: Pivot and Complement–A Heuristic for 0-1 Programming
cites work: The Reactive Tabu Search
cites work: Local search with memory: Benchmarking RTS
cites work: Q3241581
cites work: The noising method: A new method for combinatorial optimization
cites work: Dynamic tabu list management using the reverse elimination method
cites work: A simulated annealing approach to the multiconstraint zero-one knapsack problem
cites work: New optimization heuristics. The great deluge algorithm and the record- to-record travel
cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
cites work: Calculating surrogate constraints
cites work: An exact algorithm for the 0-1 collapsing knapsack problem
cites work: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
cites work: Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
cites work: An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
cites work: An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
cites work: The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
cites work: The Theory and Computation of Knapsack Functions
cites work: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Tabu Search—Part I
cites work: Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
cites work: Q4350063
cites work: Q4354785
cites work: Q4692508
cites work: Q4350066
cites work: Q4079017
cites work: ``Neural'' computation of decisions in optimization problems
cites work: Optimization by Simulated Annealing
cites work: Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach
cites work: Q4350067
cites work: Tabu search within a pivot and complement framework
cites work: Equation of State Calculations by Fast Computing Machines
cites work: Q4350034
cites work: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
cites work: Q4350070
description: scientific article; zbMATH DE number 1782830