DISCON: A New Method for the Layout Problem

Zvi Drezner
Additional contact information
Zvi Drezner: University of Michigan-Dearborn, Dearborn, Michigan

Operations Research, 1980, vol. 28, issue 6, 1375-1384

Abstract: Layout problems often involve a given number of facilities which must be located in the plane. Each of these facilities has a given area, and the cost of interactions between every facility pair is known. Problem optimality is achieved when facilities do not overlap and the total cost, which is the sum of weighted distances between all pairs of facilities, is minimized. The problem is formulated and solved as a nonconvex mathematical programming problem using a procedure termed DISpersion-CONcentration.

Date: 1980
References: Add references at CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.28.6.1375 (application/pdf)

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:inm:oropre:v:28:y:1980:i:6:p:1375-1384

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().