Optimization Online


Locating Restricted Facilities on Binary Maps

Mugurel Ionut Andreica(mugurelionut***at***gmail.com)
Cristina Teodora Andreica(cristinandreica***at***yahoo.com)
Madalina Ecaterina Andreica(fuzzy_nightingale***at***yahoo.com)

Abstract: In this paper we consider several facility location problems with applications to cost and social welfare optimization, when the area map is encoded as a binary (0,1) mxn matrix. We present algorithmic solutions for all the problems. Some cases are too particular to be used in practical situations, but they are at least a starting point for more generic solutions.

Keywords: facility location, binary matrix, maximum perimeter sum rectangle, largest square, largest diamond

Category 1: Applications -- Science and Engineering (Facility Planning and Design )

Category 2: Other Topics (Dynamic Programming )

Category 3: Other Topics (Other )

Citation: Proceedings of the International Symposium on Social Development and Economic Performance - Supplement of the Magazine "Quality - Access to Success", vol. 89, pp. 87-91, Satu Mare, 20-21 June, 2008. (ISSN: 1582-2559)

Download: [PDF]

Entry Submitted: 09/19/2008
Entry Accepted: 09/19/2008
Entry Last Modified: 09/19/2008

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society