Cost Based Filtering for the Constrained Knapsack Problem

Torsten Fahle () and Meinolf Sellmann ()

Annals of Operations Research, 2002, vol. 115, issue 1, 73-93

Abstract: We present cost based filtering methods for Knapsack Problems (KPs). Cost based filtering aims at fixing variables with respect to the objective function. It is an important technique when solving complex problems such as Quadratic Knapsack Problems, or KPs with additional constraints (Constrained Knapsack Problems (CKPs)). They evolve, e.g., when Constraint Based Column Generation is applied to appropriate optimization problems. We develop new reduction algorithms for KP. They are used as propagation routines for the CKP with Θ(nlog n) preprocessing time and Θ(n) time per call. This sums up to an amortized time Θ(n) for Ω(log n) incremental calls where the subsequent problems may differ with respect to arbitrary sets of necessarily included and excluded items. Copyright Kluwer Academic Publishers 2002

Keywords: constraint programming; constrained knapsack problems; cost based filtering; optimization constraints; reduction algorithms (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1021193019522 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:115:y:2002:i:1:p:73-93:10.1023/a:1021193019522

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1021193019522

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().