Using surrogate constraints in genetic algorithms for solving multidimensional knapsack problems

Authors:
Christian Haul;Stefan Voß
Affiliations:
-;-
Venue:
Advances in computational and stochastic optimization, logic programming, and heuristic search
Year:
1997

Combinatorial Auctions, Knapsack Problems, and Hill-Climbing Search

AI '01 Proceedings of the 14th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
Meta-RaPs approach for the 0-1 multidimensional Knapsack problem

Computers and Industrial Engineering - Special issue: Selected papers from the 31st international conference on computers & industrial engineering
Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search

Computers and Operations Research
A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem

INFORMS Journal on Computing
Meta-RaPS approach for the 0-1 Multidimensional Knapsack Problem

Computers and Industrial Engineering - Special issue: Selected papers from the 31st international conference on computers & industrial engineering

Hi-index	0.00