An Algorithm for a Constrained Weber Problem

We present an algorithm for solving the Weber problem when the set of feasible locations is the union of a finite number of convex polygons.

Year of publication:	1982
Authors:	Hansen, P. ; Peeters, D. ; Thisse, J.-F.
Published in:	Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 28.1982, 11, p. 1285-1295
Publisher:	Institute for Operations Research and the Management Sciences - INFORMS
Subject:	facilities: location algorithm

Extent:	application/pdf
Type of publication:	Article
Other identifiers:	10.1287/mnsc.28.11.1285 [DOI]
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10009218139