Location and sizing of facilities on a line
type: Item
instance of: scholarly article
title: Location and sizing of facilities on a line
zbMATH Open document ID: 0995.90066
DOI: 10.1007/BF02579086
author: Jack Brimberg
author: Abraham Mehrez
published in: Top
publication date: 2002-09-23T00:00:00Z
review text: The authors describe a specific location-allocation problem which differs from the known basic form, which assumes that the number of facilities to be realized are known and their capacities are unlimited. For such models the data basis are (defined) sets of possible facility locations and demand (or customer) nodes spread out in a plane or a network. In this paper attention is given to two modifications, at first the node sets are restricted to a line and second the needed number of facilities and their capacities are introduced in the decision process. For the first modification it is known, that these problems can be solved efficiently using dynamic programming. Adding the second modification a more complex structure appears. The authors show, that it is easier to solve such problems (also by dynamic programming) then those without the additional restrictions.
reviewed by: Joachim R. Daduna
Mathematics Subject Classification ID: 90B85
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 1740555
zbMATH Keywords: location-allocation
zbMATH Keywords: collinear structure
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
cites work: Q4383631
cites work: Solving a class of two-dimensional uncapacitated location-allocation problems by dynamic programming
cites work: Solving the plant location problem on a line by linear programming
cites work: Improved complexity bounds for location problems on the real line
cites work: Note—One-Dimensional Facility Location-Allocation using Dynamic Programming
cites work: Q4203976
description: scientific article; zbMATH DE number 1740555