A Study of the Compartimentalized Knapsack Problem with Additional Restrictions

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 o...

Full description

Saved in:
Bibliographic Details
Published in:Revista IEEE América Latina 2010-06, Vol.8 (3), p.269-274
Main Authors: Hoto, R, Maculan, N, Borssoi, A
Format: Article
Language:English
Subjects:
Algorithms
column generation
compartimentalized
Compartments
Constraints
Cutting
Heuristic
knapsack
Knapsack problem
Mathematical model
Mathematical models
Neural networks
Strategy
Upper bound
Upper bounds
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1548-0992
1548-0992
DOI:10.1109/TLA.2010.5538401