Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search

Simple item page
dc.creatorBoussier, Sylvain
dc.creatorVasquez, Michel
dc.creatorVimont, Yannick
dc.creatorHanafi, Said
dc.creatorMichelon, Philippe
dc.date2009-05-06
dc.date.accessioned2026-07-07T13:12:18Z
dc.date.available2026-07-07T13:12:18Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0905.0848
dc.identifierhttp://arxiv.org/abs/0905.0848
dc.identifierVI ALIO/EURO Workshop on Applied Combinatorial Optimization, Buenos Aires : Argentine (2008)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/229540
dc.subjectDiscrete Mathematics
dc.titleSolving the 0-1 Multidimensional Knapsack Problem with Resolution Search
dc.typetext

Files

Collections

arXiv