IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-540-69995-8_82.html
   My bibliography  Save this book chapter

A Branch and Bound Algorithm Based on DC Programming and DCA for Strategic Capacity Planning in Supply Chain Design for a New Market Opportunity

In: Operations Research Proceedings 2006

Author

Listed:
  • Nguyen Canh Nam

    (National Institute for Applied Sciences)

  • Thi Hoai An

    (Metz University)

  • Pham Dinh Tao

    (National Institute for Applied Sciences)

Abstract

Supply chain network are considered as solution for effectively meeting customer requirements such as low cost, high product variety, quality and shorter lead times. The success of a supply chain lies in good strategic and tactical planning and monitoring at the operational level. Strategic planning is long term planning and usually consists in selecting providers and distributors, location and capacity planning of manufacturing/servicing units, among others.

Suggested Citation

  • Nguyen Canh Nam & Thi Hoai An & Pham Dinh Tao, 2007. "A Branch and Bound Algorithm Based on DC Programming and DCA for Strategic Capacity Planning in Supply Chain Design for a New Market Opportunity," Operations Research Proceedings, in: Karl-Heinz Waldmann & Ulrike M. Stocker (ed.), Operations Research Proceedings 2006, pages 515-520, Springer.
    • Handle: RePEc:spr:oprchp:978-3-540-69995-8_82
    DOI: 10.1007/978-3-540-69995-8_82
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:oprchp:978-3-540-69995-8_82. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.