Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search

Details Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search

2009-05-06

arxiv.org/abs/0905.0848v1

VI ALIO/EURO Workshop on Applied Combinatorial Optimization, Buenos Aires : Argentine (2008)

Computer Science

Discrete Mathematics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-542441