New solutions to the constrained compartmentalised knapsack problem
by Robinson S.V. Hoto; Glaucia Maria Bressan
International Journal of Operational Research (IJOR), Vol. 28, No. 4, 2017

Abstract: The compartmentalised knapsack problem has been described in the literature as generating patterns of cutting problems in two phases. An exact algorithm, which involves the solution of several knapsacks, and another one, based on upper bounds, have already been developed. In the constrained case of a compartmentalised knapsack, in which bounds in the number of compartments and items are required, few results are known. In this paper, we present a new heuristic to solve the constrained case of the compartmentalised knapsack problem and make comparisons with the best heuristic registered in the literature.

Online publication date: Fri, 03-Mar-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com