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

Construction Line Algorithms for the Connection Location-Allocation Problem

In: Operations Research Proceedings 2007

Author

Listed:
  • Martin Bischoff

    (University of Erlangen-Nuremberg)

  • Yvonne Bayer

    (University of Erlangen-Nuremberg)

Abstract

In the connection location-allocation problem we are given a set of material flows between pairs of existing facilities each of which must be routed through a connection facility. The objective is to minimize the total transportation costs by locating a given number of connections and allocating the flows accordingly. For this problem many properties and solution methods of the well-known facility location-allocation problem can be transferred, among others the construction line algorithm, an exact solution method based on discretization results under polyhedral gauge distances. We have implemented construction line algorithms for the connection location-allocation problem without restrictions as well as in the presence of forbidden regions or barriers. We considered various distance functions, ranging from the Manhattan distance to mixed polyhedral gauge distances and applied hull properties to further reduce the dominating set.

Suggested Citation

  • Martin Bischoff & Yvonne Bayer, 2008. "Construction Line Algorithms for the Connection Location-Allocation Problem," Operations Research Proceedings, in: Jörg Kalcsics & Stefan Nickel (ed.), Operations Research Proceedings 2007, pages 345-350, Springer.
    • Handle: RePEc:spr:oprchp:978-3-540-77903-2_53
    DOI: 10.1007/978-3-540-77903-2_53
    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-77903-2_53. 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.