DocumentCode
1284701
Title
A Study of the Compartimentalized Knapsack Problem with Additional Restrictions
Author
Hoto, R. ; Maculan, N. ; Borssoi, A.
Author_Institution
Dept. de Mat., Univ. Estadual de Londrina, Londrina, Brazil
Volume
8
Issue
3
fYear
2010
fDate
6/1/2010 12:00:00 AM
Firstpage
269
Lastpage
274
Abstract
The Compartimentalized Knapsack Problem has been reported in the literature to generate cutting patterns of problems in two stages. The problem has constrained case, which are considered limits on the number of compartments and items in the knapsack. An exact algorithm that involves the resolution of various knapsacks and heuristics based on upper bound has already been developed. In this paper we present the problem with mathematical models and propose new strategies for resolving the constrained case.
Keywords
knapsack problems; mathematical analysis; additional restrictions; compartimentalized knapsack problem; mathematical models; Artificial neural networks; Heuristic algorithms; Irrigation; Mathematical model; Neural networks; Optimization; Random access memory; Upper bound; Heuristic; column generation; compartimentalized; knapsack;
fLanguage
English
Journal_Title
Latin America Transactions, IEEE (Revista IEEE America Latina)
Publisher
ieee
ISSN
1548-0992
Type
jour
DOI
10.1109/TLA.2010.5538401
Filename
5538401
Link To Document