IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v5y1997i2p213-219.html
   My bibliography  Save this article

A comparison of algorithm RS with algorithm OPTSOL70

Author

Listed:
  • Marc Almiñana
  • Jesús Pastor

Abstract

No abstract is available for this item.

Suggested Citation

  • Marc Almiñana & Jesús Pastor, 1997. "A comparison of algorithm RS with algorithm OPTSOL70," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 5(2), pages 213-219, December.
    • Handle: RePEc:spr:topjnl:v:5:y:1997:i:2:p:213-219
    DOI: 10.1007/BF02568550
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF02568550
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF02568550?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. R. Roth, 1969. "Computer Solutions to Minimum-Cover Problems," Operations Research, INFORMS, vol. 17(3), pages 455-465, June.
    2. Francis J. Vasko & George R. Wilson, 1986. "Hybrid heuristics for minimum cardinality set covering problems," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 33(2), pages 241-249, May.
    3. M. Almiñana & J. Pastor, 1994. "Two new heuristics for the location set covering problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 2(2), pages 315-328, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Alminana, Marcos & Pastor, Jesus T., 1997. "An adaptation of SH heuristic to the location set covering problem," European Journal of Operational Research, Elsevier, vol. 100(3), pages 586-593, August.
    2. J. E. Beasley, 1990. "A lagrangian heuristic for set‐covering problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(1), pages 151-164, February.
    3. Yijun Shi & Guofang Zhai & Lihua Xu & Quan Zhu & Jinyang Deng, 2019. "Planning Emergency Shelters for Urban Disasters: A Multi-Level Location–Allocation Modeling Approach," Sustainability, MDPI, vol. 11(16), pages 1-19, August.
    4. Gang Du & Chuanwang Sun, 2015. "Location Planning Problem of Service Centers for Sustainable Home Healthcare: Evidence from the Empirical Analysis of Shanghai," Sustainability, MDPI, vol. 7(12), pages 1-21, November.
    5. Murray, Alan T., 2001. "Strategic analysis of public transport coverage," Socio-Economic Planning Sciences, Elsevier, vol. 35(3), pages 175-188, September.
    6. Brian J. Lunday & J. Cole Smith & Jeffrey B. Goldberg, 2005. "Algorithms for solving the conditional covering problem on paths," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(4), pages 293-301, June.
    7. Ye, Lin & Ye, Chunming & Chuang, Yi-Fei, 2011. "Location set covering for waste resource recycling centers in Taiwan," Resources, Conservation & Recycling, Elsevier, vol. 55(11), pages 979-985.

    More about this item

    Keywords

    Location; Set-Covering; Heuristics; 90C10; 90C27;
    All these keywords.

    JEL classification:

    Statistics

    Access and download statistics

    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:spr:topjnl:v:5:y:1997:i:2:p:213-219. See general information about how to correct material in RePEc.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.