Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
An efficient preprocessing procedure for the multidimensional 0–1 knapsack problem
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Using surrogate constraints in genetic algorithms for solving multidimensional knapsack problems
Advances in computational and stochastic optimization, logic programming, and heuristic search
Meta-Heuristics: Theory and Applications
Meta-Heuristics: Theory and Applications
Tabu Search
A Genetic Algorithm for the Multidimensional Knapsack Problem
Journal of Heuristics
Core Problems in Knapsack Algorithms
Operations Research
Discrete facility location and routing of obnoxious activities
Discrete Applied Mathematics - International symposium on combinatorial optimisation
Integer optimization by local search: a domain-independent approach
Integer optimization by local search: a domain-independent approach
Discrete facility location and routing of obnoxious activities
Discrete Applied Mathematics - International symposium on combinatorial optimisation
Adaptive memory search for multidemand multidimensional knapsack problems
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Workload-based generation of administrator hints for optimizing database storage utilization
ACM Transactions on Storage (TOS)
The importance of being careful
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
Black box scatter search for general classes of binary optimization problems
Computers and Operations Research
Alternating control tree search for knapsack/covering problems
Journal of Heuristics
A fully polynomial approximation scheme for a knapsack problem with a minimum filling constraint
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
| Hi-index | 0.00 |
We consider an extension of the 0-1 multidimensional knapsack problem in which there are greater-than-or-equal-to inequalities, called demand constraints, in addition to the standard less-than-or-equal-to constraints. Moreover, the objective function coefficients are not constrained in sign. This problem is worth considering because it is embedded in models of practical application, it has an intriguing combinatorial structure, and it appears to be a challenging problem for commercial ILP solvers. Our approach is based on a nested tabu-search algorithm in which neighborhoods with different structures are exploited. First, a tabu-search procedure is carried out in which mainly the infeasible region is explored. Once feasibility has been established, a second tabu-search procedure, which analyzes only feasible solutions, is applied. The algorithm has been tested on a wide set of instances. Computational results are discussed.