The multidimensional 0–1 knapsack problem is one of the most well-known integer
programming problems and has received wide attention from the operational research …

In this paper we present a heuristic based upon genetic algorithms for the multidimensional
knapsack problem. A heuristic operator which utilises problem-specific knowledge is …

Abstract The multidimensional 0-1 knapsack problem (MKP) is a resource allocation model
that is one of the most well-known integer programming problems. During the last few …

1 Introduction.-1.1. Purpose of the Investigation.-1.2. Methodology Used.-1.3. Structure of the
Book.-2 Cutting and Packing Problems as Geometric-Combinatoric Problems.-2.1. Basic …

We present an Approximate Dynamic Programming (ADP) approach for the
multidimensional knapsack problem (MKP). We approximate the value function (a) using …

This paper presents a heuristic to solve the Multidimensional Multiple-choice Knapsack
Problem (MMKP), a variant of the classical 0–1 Knapsack Problem. We apply a …

In this paper we present an algorithm to solve an as-yet untreated knapsack problem, the
Multidimensional Multiple-choice Knapsack Problem (MMKP). Since our specific application …

An extensive search of journal publications on heuristic methods and applications produced
442 articles published in 37 journals during the last sixteen years. A scheme is employed to …

In this paper, we propose a new greedy-like heuristic method, which is primarily intended for
the general MDKP, but proves itself effective also for the 0-1 MDKP. Our heuristic differs from …

The paper presents an improved hybrid genetic algorithm (GA) for solving the
multiconstrained 0-1 knapsack problem (MKP). Based on the solution of the LP relaxed …