Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search

EMA); Michel Vasquez (LGI2P; Philippe Michelon (LIA); Said Hanafi (LAMIH); Sylvain Boussier (LIA); Yannick Vimont (LGI2P)

arxiv: 0905.0848 · v1 · submitted 2009-05-06 · 💻 cs.DM

Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search

Sylvain Boussier (LIA) , Michel Vasquez (LGI2P , EMA) , Yannick Vimont (LGI2P) , Said Hanafi (LAMIH) , Philippe Michelon (LIA) This is my paper

classification 💻 cs.DM

keywords instancesknapsackmultidimensionalproblemresolutionsearchsolvingvalues

0 comments

read the original abstract

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.

This paper has not been read by Pith yet.

Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search

discussion (0)