Recent Hybrid Techniques for the Multi-Knapsack Problem

Authors:
Carlos Diego Rodrigues;Philippe Michelon;Manoel B. Campêlo
Affiliations:
Laboratoire d'Informatique de Avignon, Université d'Avignon, Avignon F84911 and Universidade Federal do Ceará, Brazil;Laboratoire d'Informatique de Avignon, Université d'Avignon, Avignon F84911;Universidade Federal do Ceará, Brazil
Venue:
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Year:
2008

Citing 3
Cited 0

An efficient preprocessing procedure for the multidimensional 0–1 knapsack problem

Discrete Applied Mathematics - Special volume: viewpoints on optimization
Cost-Based Domain Filtering

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
A hybrid approach for the 0-1 multidimensional knapsack problem

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

The cooperation between the Mathematical Programming (MP) and Constraint Programming (CP) paradigms has come to focus in the recent years. The impossibility of solving bigger instances alone and the apparently complementarity between the two approaches pushes towards further researches on hybrid methods. We can define a linear binary optimization problem as (P) { min c.x: Ax≤ b, x茂戮驴 Bn}, where xis a binary variable, A茂戮驴 Rm×nis the constraint matrix, b茂戮驴 Rmis the right-hand side vector and c茂戮驴 Rnis the objective function.