IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v219y2012i1p49-58.html
   My bibliography  Save this article

Closest assignment constraints in discrete location problems

Author

Listed:
  • Espejo, Inmaculada
  • Marín, Alfredo
  • Rodríguez-Chía, Antonio M.

Abstract

The objective of this paper is to identify the most promising sets of closest assignment constraints in the literature of Discrete Location Theory, helping the authors in the field to model their problems when clients must be assigned to the closest plant inside an Integer Programming formulation. In particular, constraints leading to weak Linear Programming relaxations should be avoided if no other good property supports their use. We also propose a new set of constraints with good theoretical properties.

Suggested Citation

  • Espejo, Inmaculada & Marín, Alfredo & Rodríguez-Chía, Antonio M., 2012. "Closest assignment constraints in discrete location problems," European Journal of Operational Research, Elsevier, vol. 219(1), pages 49-58.
  • Handle: RePEc:eee:ejores:v:219:y:2012:i:1:p:49-58
    DOI: 10.1016/j.ejor.2011.12.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221711010575
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Pierre Hanjoul & Pierre Hansen & Dominique Peeters & Jacques-Francois Thisse, 1990. "Uncapacitated Plant Location Under Alternative Spatial Price Policies," Management Science, INFORMS, vol. 36(1), pages 41-57, January.
    2. Jörg Kalcsics & Stefan Nickel & Justo Puerto & Antonio Rodríguez-Chía, 2010. "The ordered capacitated facility location problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 203-222, July.
    3. Teixeira, Joao C. & Antunes, Antonio P., 2008. "A hierarchical location model for public facility planning," European Journal of Operational Research, Elsevier, vol. 185(1), pages 92-104, February.
    4. Plastria, Frank, 2002. "Formulating logical implications in combinatorial optimisation," European Journal of Operational Research, Elsevier, vol. 140(2), pages 338-353, July.
    5. Hanjoul, Pierre & Peeters, Dominique, 1987. "A facility location problem with clients' preference orderings," Regional Science and Urban Economics, Elsevier, vol. 17(3), pages 451-473, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. repec:spr:annopr:v:253:y:2017:i:1:d:10.1007_s10479-016-2353-7 is not listed on IDEAS
    2. repec:iim:iimawp:13011 is not listed on IDEAS
    3. Espejo, Inmaculada & Marín, Alfredo & Rodríguez-Chía, Antonio M., 2015. "Capacitated p-center problem with failure foresight," European Journal of Operational Research, Elsevier, vol. 247(1), pages 229-244.
    4. Mestre, Ana Maria & Oliveira, Mónica Duarte & Barbosa-Póvoa, Ana Paula, 2015. "Location–allocation approaches for hospital network planning under uncertainty," European Journal of Operational Research, Elsevier, vol. 240(3), pages 791-806.
    5. Jayaswal, Sachin, 2014. "Emergency Medical Service System Design under Service Level Constraints for Heterogeneous Patients," IIMA Working Papers WP2014-11-04, Indian Institute of Management Ahmedabad, Research and Publication Department.
    6. Laporte, Gilbert & Ortega, Francisco A. & Pozo, Miguel A. & Puerto, Justo, 2017. "Multi-objective integration of timetables, vehicle schedules and user routings in a transit network," Transportation Research Part B: Methodological, Elsevier, vol. 98(C), pages 94-112.
    7. repec:spr:annopr:v:246:y:2016:i:1:d:10.1007_s10479-015-1886-5 is not listed on IDEAS
    8. repec:eee:ejores:v:267:y:2018:i:2:p:496-512 is not listed on IDEAS
    9. Ramamoorthy, Prasanna & Jayaswal, Sachin & Sinha, Ankur & Vidyarthi, Navneet, 2016. "Hub Interdiction & Hub Protection problems: Model formulations & Exact Solution methods. (Revised)," IIMA Working Papers WP2016-10-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    10. Bronfman, Andrés & Marianov, Vladimir & Paredes-Belmar, Germán & Lüer-Villagra, Armin, 2015. "The maximin HAZMAT routing problem," European Journal of Operational Research, Elsevier, vol. 241(1), pages 15-27.
    11. repec:eee:ejores:v:262:y:2017:i:2:p:509-520 is not listed on IDEAS

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:219:y:2012:i:1:p:49-58. 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: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/eor .

    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 CitEc recognized a reference but did not link an item in RePEc 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 RePEc Author Service 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.