IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v5y2009i3p280-291.html
   My bibliography  Save this article

An exact algorithm for the Knapsack Problem with Setup

Author

Listed:
  • Yanchun Yang
  • Robert L. Bulfin

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.

Suggested Citation

  • Yanchun Yang & Robert L. Bulfin, 2009. "An exact algorithm for the Knapsack Problem with Setup," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 5(3), pages 280-291.
    • Handle: RePEc:ids:ijores:v:5:y:2009:i:3:p:280-291
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=25197
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijores:v:5:y:2009:i:3:p:280-291. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.