Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search

DOI10.1016/J.COR.2003.08.021MaRDI QIDQ706997zbMATHOpenAlexFDO

Authors Vincent C. Li, Guy L. Curry

Publication date 9 February 2005

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2003.08.021

zbMATH Keywords

Critical event tabu searchGUBMultidimensional knapsackStrategic oscillationSurrogate constraint

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1054947
• Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem
• Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem
• Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem

Cites work

• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1281676 (Why is no real title available?)
• scientific article; zbMATH DE number 1302201 (Why is no real title available?)
• scientific article; zbMATH DE number 1054925 (Why is no real title available?)
• scientific article; zbMATH DE number 1054947 (Why is no real title available?)
• scientific article; zbMATH DE number 1082099 (Why is no real title available?)
• scientific article; zbMATH DE number 1114464 (Why is no real title available?)
• A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• A Note on Approximation Schemes for Multidimensional Knapsack Problems
• A fully polynomial approximation algorithm for the 0-1 knapsack problem
• A genetic algorithm for the multidimensional knapsack problem
• A heuristic algorithm for the multidimensional zero-one knapsack problem
• A note on hashing functions and tabu search algorithms
• A simulated annealing approach to the multiconstraint zero-one knapsack problem
• An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
• An approximate dynamic programming approach to multidimensional knapsack problems
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem
• Dynamic tabu list management using the reverse elimination method
• Extension of reverse elimination method through a dynamic management of the tabu list
• Future paths for integer programming and links to artificial intelligence
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Hashing vectors for tabu search
• Heuristic algorithms for the multiple knapsack problem
• Metaheuristics: A bibliography
• Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)
• Multiple choice programming: A state-of-the-art review
• Optimization by simulated annealing
• Pivot and Complement–A Heuristic for 0-1 Programming
• Solving zero-one mixed integer programming problems using tabu search
• Surrogate Constraint Duality in Mathematical Programming
• Surrogate Constraints
• Surrogate Mathematical Programming
• Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic
• Tabu Search—Part I
• Tabu Search—Part II
• Tabu search techniques. A tutorial and an application to neural networks
• Tabu search within a pivot and complement framework
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The Reactive Tabu Search
• The Theory and Computation of Knapsack Functions
• Towards the real time solution of strike force asset allocation problems
• Tutorial on surrogate constraint approaches for optimization in graphs

Cited in

(11)

• Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
• Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem
• scientific article; zbMATH DE number 1054947 (Why is no real title available?)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems
• Scatter search for the 0-1 multidimensional knapsack problem
• Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
• Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
• A Modified Binary Particle Swarm Optimization for Knapsack Problems
• Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints
• A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem

Describes a project that uses

Uses Software

• Tabu search

This page was built for publication: Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q706997)