![](/images/graphics-bg.png)
Polynomial Time Instances for the IKHO Problem
Joint Authors
Source
Issue
Vol. 2012, Issue 2012 (31 Dec. 2012), pp.1-10, 10 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2012-04-08
Country of Publication
Egypt
No. of Pages
10
Main Subjects
Abstract EN
The Interactive Knapsacks Heuristic Optimization (IKHO) problem is a particular knapsacks model in which, given an array of knapsacks, every insertion in a knapsack affects also the other knapsacks, in terms of weight and profit.
The IKHO model was introduced by Isto Aho to model instances of the load clipping problem.
The IKHO problem is known to be APX-hard and, motivated by this negative fact, Aho exhibited a few classes of polynomial instances for the IKHO problem.
These instances were obtained by limiting the ranges of two structural parameters, c and u, which describe the extent to which an insertion in a knapsack in uences the nearby knapsacks.
We identify a new and broad class of instances allowing for a polynomial time algorithm.
More precisely, we show that the restriction of IKHO to instances where (c+2u)/c is bounded by a constant can be solved in polynomial time, using dynamic programming.
American Psychological Association (APA)
Rizzi, Romeo& Nardin, Luca. 2012. Polynomial Time Instances for the IKHO Problem. ISRN Electronics،Vol. 2012, no. 2012, pp.1-10.
https://search.emarefa.net/detail/BIM-504040
Modern Language Association (MLA)
Rizzi, Romeo& Nardin, Luca. Polynomial Time Instances for the IKHO Problem. ISRN Electronics No. 2012 (2012), pp.1-10.
https://search.emarefa.net/detail/BIM-504040
American Medical Association (AMA)
Rizzi, Romeo& Nardin, Luca. Polynomial Time Instances for the IKHO Problem. ISRN Electronics. 2012. Vol. 2012, no. 2012, pp.1-10.
https://search.emarefa.net/detail/BIM-504040
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-504040