An algorithm for the disjunctively constrained knapsack problem
by Mhand Hifi; Nabil Otmani
International Journal of Operational Research (IJOR), Vol. 13, No. 1, 2012

Abstract: This paper proposes an adaptation of the scatter search (SS) meta-heuristic for approximately solving the disjunctively constrained knapsack problem (DCKP). The DCKP can be viewed as a variant of the standard knapsack problem with special disjunctive constraints. Two versions of SS are presented which are organised following the usual structure of SS. The method is analysed computationally on a set of problem instances of the literature and compared to the results provided by the Cplex solver and other algorithms of the literature. For these instances, most of which cannot be solved to proven optimality in a reasonable time, the proposed method provides results of high quality within reasonable computational time.

Online publication date: Sun, 11-Jan-2015

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