Two Algorithms for the Multi-Weber Problem

Britton Harris ()

Annals of Operations Research, 2003, vol. 123, issue 1, 37-52

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

Keywords: partitioning; optimality; set-covering (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1026162910777 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:123:y:2003:i:1:p:37-52:10.1023/a:1026162910777

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1026162910777

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().