An exact algorithm for the Knapsack Problem with Setup

Yanchun Yang and Robert L. Bulfin

International Journal of Operational Research, 2009, vol. 5, issue 3, 280-291

Abstract: In this paper we studies a 0-1 Knapsack Problem with Setup (KPS). One set of 0-1 variables represent a family setup and serve as an Upper Bound (UB) on another set of 0-1 variables representing production of a job in a family. We present a branch-and-bound algorithm to find an optimal solution to KPS. The algorithm uses a two-stage branching strategy and chooses the next candidate problem to explore in a non-traditional way. We verify the efficacy of the algorithm through computational testing. This is the first time that an exact algorithm given to KPS with 10,000 integer variables. Computational experiments show that this algorithm is especially effective when objective and constraint coefficients are uncorrelated.

Keywords: knapsack problem; setup; branch-and-bound; upper bound. (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=25197 (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:ids:ijores:v:5:y:2009:i:3:p:280-291

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().