IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v123y2003i1p37-5210.1023-a1026162910777.html
   My bibliography  Save this article

Two Algorithms for the Multi-Weber Problem

Author

Listed:
  • Britton Harris

Abstract

This paper develops two methods for finding building-blocks for solving Rosing's multi-Weber problem as a set-covering problem in zero–one programming. The building blocks are those subsets of the universe of points to be partitioned that do not contain any non-members within their own convex hulls. For a particular universe of 100 cities, there are almost six billion such subsets, and the paper sets out computational methods that make this enumeration feasible. Some of these methods have wider applications, but the central methods are closely tailored to this problem. Means are also suggested for reducing the number of subsets to be enumerated, without ruling out possibly optimal solutions for the complete problem. Copyright Kluwer Academic Publishers 2003

Suggested Citation

  • Britton Harris, 2003. "Two Algorithms for the Multi-Weber Problem," Annals of Operations Research, Springer, vol. 123(1), pages 37-52, October.
    • Handle: RePEc:spr:annopr:v:123:y:2003:i:1:p:37-52:10.1023/a:1026162910777
    DOI: 10.1023/A:1026162910777
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1026162910777
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1026162910777?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
    ---><---

    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:spr:annopr:v:123:y:2003:i:1:p:37-52:10.1023/a:1026162910777. 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.