The Facility Location Problem with Limited Distances

descriptionPublicationkeyboard_double_arrow_right Article 01 Aug 1991 English Publisher:Institute for Operations Research and the Management Sciences (INFORMS)Journal:Transportation Science, volume 25, pages 183-187 (issn: 0041-1655, eissn: 1526-5447,

Copyright policy )

Authors: Zvi Drezner; Avram Mehrez; George O. Wesolowsky;

doi: 10.1287/trsc.25.3.183

The Facility Location Problem with Limited Distances

- Summary
- Subjects
- Metrics

Abstract

In this paper we consider minisum and minimax single facility location problems where the effective service distance becomes a constant when the actual distance attains or exceeds a certain value. Properties of these problems are studied, and algorithms for their solution are presented.

Related Organizations

McMaster University
Canada
Ben-Gurion University of the Negev
Israel
California State University, Fullerton
United States

Keywords

Discrete location and assignment, Mixed integer programming, minisum and minimax single facility location, Computational methods for problems pertaining to operations research and mathematical programming

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	38
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average