Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
type: Item
instance of: scholarly article
title: Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
zbMATH Open document ID: 1071.90050
published in: Computers \& Operations Research
publication date: 2005-02-09T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2132693
zbMATH Keywords: Critical event tabu search
zbMATH Keywords: Strategic oscillation
zbMATH Keywords: Surrogate constraint
zbMATH Keywords: Multidimensional knapsack
zbMATH Keywords: GUB
author: Vincent C. Li
author: Guy L. Curry
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.cor.2003.08.021
OpenAlex ID: W2027066045
cites work: Towards the real time solution of strike force asset allocation problems
cites work: Q4198056
cites work: Heuristic algorithms for the multiple knapsack problem
cites work: Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
cites work: A heuristic algorithm for the multidimensional zero-one knapsack problem
cites work: An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
cites work: Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)
cites work: Multiple choice programming: A state-of-the-art review
cites work: A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
cites work: Q4240871
cites work: The Theory and Computation of Knapsack Functions
cites work: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
cites work: A fully polynomial approximation algorithm for the 0-1 knapsack problem
cites work: A Note on Approximation Schemes for Multidimensional Knapsack Problems
cites work: Q4178782
cites work: Surrogate Constraints
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Q4365126
cites work: Metaheuristics: A bibliography
cites work: Q4350034
cites work: Q4377048
cites work: A simulated annealing approach to the multiconstraint zero-one knapsack problem
cites work: Q4350063
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Tabu search techniques. A tutorial and an application to neural networks
cites work: Q4247468
cites work: Optimization by Simulated Annealing
cites work: Dynamic tabu list management using the reverse elimination method
cites work: Extension of reverse elimination method through a dynamic management of the tabu list
cites work: Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic
cites work: Tabu search within a pivot and complement framework
cites work: Pivot and Complement–A Heuristic for 0-1 Programming
cites work: The Reactive Tabu Search
cites work: Solving zero-one mixed integer programming problems using tabu search
cites work: An efficient tabu search approach for the 0-1 multidimensional knapsack problem
cites work: A note on hashing functions and tabu search algorithms
cites work: Hashing vectors for tabu search
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Surrogate Mathematical Programming
cites work: Surrogate Constraint Duality in Mathematical Programming
cites work: Tutorial on surrogate constraint approaches for optimization in graphs
DOI: 10.1016/J.COR.2003.08.021
description: scientific article; zbMATH DE number 2132693