IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v28y1981i4p607-617.html
   My bibliography  Save this article

A branch‐and‐bound algorithm for solving fixed charge problems

Author

Listed:
  • Patrick G. McKeown

Abstract

Numerous procedures have been suggested for solving fixed charge problems. Among these are branch‐and‐bound methods, cutting plane methods, and vertex ranking methods. In all of these previous approaches, the procedure depends heavily on the continuous costs to terminate the search for the optimal solution. In this paper, we present a new branch‐and‐bound algorithm that calculates bounds separately on the sum of fixed costs and on the continuous objective value. Computational experience is shown for various standard test problems as well as for randomly generated problems. These test results are compared to previous procedures as well as to a mixed integer code. These comparisons appear promising.

Suggested Citation

  • Patrick G. McKeown, 1981. "A branch‐and‐bound algorithm for solving fixed charge problems," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 28(4), pages 607-617, December.
    • Handle: RePEc:wly:navlog:v:28:y:1981:i:4:p:607-617
    DOI: 10.1002/nav.3800280409
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800280409
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800280409?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Joanne Schaffer, 1987. "Procedure for solving the data‐editing problem with both continuous and discrete data types," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(6), pages 879-890, December.
    2. A. N. Balaji & J. Mukund Nilakantan & Izabela Nielsen & N. Jawahar & S. G. Ponnambalam, 2019. "Solving fixed charge transportation problem with truck load constraint using metaheuristics," Annals of Operations Research, Springer, vol. 273(1), pages 207-236, February.

    More about this item

    Statistics

    Access and download statistics

    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:wly:navlog:v:28:y:1981:i:4:p:607-617. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.