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.021zbMATH Open1071.90050OpenAlexW2027066045MaRDI QIDQ706997FDOQ706997
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
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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- Optimization by simulated annealing
- Title not available (Why is that?)
- Future paths for integer programming and links to artificial intelligence
- Tabu Search—Part I
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Title not available (Why is that?)
- Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)
- A Note on Approximation Schemes for Multidimensional Knapsack Problems
- An approximate dynamic programming approach to multidimensional knapsack problems
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- Tabu Search—Part II
- Title not available (Why is that?)
- Surrogate Mathematical Programming
- A genetic algorithm for the multidimensional knapsack problem
- Surrogate Constraint Duality in Mathematical Programming
- Surrogate Constraints
- Metaheuristics: A bibliography
- The Theory and Computation of Knapsack Functions
- A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
- Heuristic algorithms for the multiple knapsack problem
- Solving zero-one mixed integer programming problems using tabu search
- The Reactive Tabu Search
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- Dynamic tabu list management using the reverse elimination method
- Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic
- Title not available (Why is that?)
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- Title not available (Why is that?)
- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
- Tabu search techniques. A tutorial and an application to neural networks
- Pivot and Complement–A Heuristic for 0-1 Programming
- A fully polynomial approximation algorithm for the 0-1 knapsack problem
- Tutorial on surrogate constraint approaches for optimization in graphs
- Extension of reverse elimination method through a dynamic management of the tabu list
- A note on hashing functions and tabu search algorithms
- Hashing vectors for tabu search
- Multiple choice programming: A state-of-the-art review
- Towards the real time solution of strike force asset allocation problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tabu search within a pivot and complement framework
Cited In (10)
- Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints
- Scatter search for the 0-1 multidimensional knapsack problem
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems
- Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
- Title not available (Why is that?)
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
Uses Software
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)
