Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
From MaRDI portal
Publication:706997
DOI10.1016/j.cor.2003.08.021zbMath1071.90050OpenAlexW2027066045MaRDI QIDQ706997
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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (8)
Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A Modified Binary Particle Swarm Optimization for Knapsack Problems ⋮ A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem ⋮ 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 ⋮ Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- Tabu search techniques. A tutorial and an application to neural networks
- Heuristic algorithms for the multiple knapsack problem
- A fully polynomial approximation algorithm for the 0-1 knapsack problem
- A genetic algorithm for the multidimensional knapsack problem
- A note on hashing functions and tabu search algorithms
- Tutorial on surrogate constraint approaches for optimization in graphs
- Solving zero-one mixed integer programming problems using tabu search
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Towards the real time solution of strike force asset allocation problems
- Future paths for integer programming and links to artificial intelligence
- Metaheuristics: A bibliography
- Dynamic tabu list management using the reverse elimination method
- Hashing vectors for tabu search
- Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List
- An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
- A Note on Approximation Schemes for Multidimensional Knapsack Problems
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- Pivot and Complement–A Heuristic for 0-1 Programming
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Tabu Search—Part I
- Tabu Search—Part II
- Surrogate Constraint Duality in Mathematical Programming
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic
- The Reactive Tabu Search
- Tabu search within a pivot and complement framework
- Multiple choice programming: A state-of-the-art review
- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
- Surrogate Constraints
- The Theory and Computation of Knapsack Functions
- Surrogate Mathematical Programming
- Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)
- A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
This page was built for publication: Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
