Solving the multiscenario Max-Min Knapsack problem exactly with column generation and branch-and-bound

Despite other variants of the standard knapsack problem, very few solution approaches have been devised for the multiscenario max-min knapsack problem. The problem consists in finding the subset of items whose total profit is maximized under the worst possible scenario. In this paper, we describe an...

Full description

Bibliographic Details
Main Author: Pinto, Telmo (author)
Other Authors: Alves, Cláudio (author), Mansi, Raid (author), Carvalho, J. M. Valério de (author)
Format: article
Language:eng
Published: 2015
Subjects:
Ciências Naturais::Matemáticas
Ciências Naturais::Ciências da Computação e da Informação
Science & Technology
Online Access:http://hdl.handle.net/1822/36517
Country:Portugal
Oai:oai:repositorium.sdum.uminho.pt:1822/36517

Internet

http://hdl.handle.net/1822/36517

Similar Items