Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We propose an exact method which combines the resolution search and branch & bound algorithms for solving the 0?1 Multidimensional Knapsack Problem. This algorithm is able to prove large?scale strong correlated instances. The optimal values of the 10 constraint, 500 variable instances of the OR-Library are exposed. These values were previously unknown.

Keywords

Discrete Mathematics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/229540

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0905.0848
 http://arxiv.org/abs/0905.0848
 VI ALIO/EURO Workshop on Applied Combinatorial Optimization, Buenos Aires : Argentine (2008)

Collections

arXiv