Advanced Search
MyIDEAS: Login to save this paper or follow this series

Locating Restricted Facilities on Binary Maps

Contents:

Author Info

  • Mugurel Ionut Andreica

    ()
    (Parallel and Distributed Systems Laboratory [Bucarest] - University Politehnica of Bucarest)

  • Cristina Teodora Andreica

    ()
    (Management and Finances Center - Commercial Academy Satu Mare)

  • Madalina Ecaterina Andreica

    ()
    (Faculty of Cybernetics, Academy of Economic Studies, Bucharest - Academy of Economic Studies, Bucharest)

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.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://hal.archives-ouvertes.fr/docs/00/78/25/03/PDF/_satumare2008_Locating_Facilities_Binary_Maps.pdf
Download Restriction: no

Bibliographic Info

Paper provided by HAL in its series Post-Print with number hal-00323318.

as in new window
Length:
Date of creation: 10 Sep 2008
Date of revision:
Publication status: Published - Presented, International Symposium on Social Development and Economic Performance, 2008, Satu Mare, Romania
Handle: RePEc:hal:journl:hal-00323318

Note: View the original document on HAL open archive server: http://hal.archives-ouvertes.fr/hal-00323318
Contact details of provider:
Web page: http://hal.archives-ouvertes.fr/

Related research

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

References

No references listed on IDEAS
You can help add them by filling out this form.

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:hal:journl:hal-00323318. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (CCSD).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.