Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem

Authors:
F. Della Croce;A. Grosso
Affiliations:
D.A.I., Politecnico di Torino, Torino, Italy;D.I., Universitá di Torino, Torino, Italy
Venue:
Computers and Operations Research
Year:
2012

Citing 5
Cited 1

A Genetic Algorithm for the Multidimensional Knapsack Problem

Journal of Heuristics
A Computational Study of Search Strategies for Mixed Integer Programming

INFORMS Journal on Computing
Exploring relaxation induced neighborhoods to improve MIP solutions

Mathematical Programming: Series A and B
A multi-level search strategy for the 0-1 Multidimensional Knapsack Problem

Discrete Applied Mathematics
The Multidimensional Knapsack Problem: Structure and Algorithms

INFORMS Journal on Computing

Improved LP-based algorithms for the closest string problem

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the 0/1 multi-dimensional knapsack problem and discuss the performances of a new heuristic procedure particularly suitable for a parallel computing environment embedding core problem approaches and a branching scheme based on reduced costs of the corresponding LP relaxation solution value. The proposed approach compared favorably to the recent state of the art procedures available in the literature on the well known OR-Library multi-dimensional knapsack problem benchmarks instances.