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

Two new heuristics for the location set covering problem

Author

Listed:
  • M. Almiñana
  • J. Pastor

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:topjnl:v:2:y:1994:i:2:p:315-328
    DOI: 10.1007/BF02574812
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF02574812
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF02574812?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. 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.
    2. Francis J. Vasko & Floyd E. Wolf & Kenneth L. Stott & James W. Scheirer, 1989. "Selecting Optimal Ingot Sizes for Bethlehem Steel," Interfaces, INFORMS, vol. 19(1), pages 68-84, February.
    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. 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. 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.

    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. Sven de Vries & Rakesh Vohra, 2000. "Combinatorial Auctions: A Survey," Discussion Papers 1296, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    2. Olli Bräysy & Michel Gendreau, 2002. "Tabu Search heuristics for the Vehicle Routing Problem with Time Windows," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 10(2), pages 211-237, December.
    3. Gérard Cornuéjols & Miroslav Karamanov & Yanjun Li, 2006. "Early Estimates of the Size of Branch-and-Bound Trees," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 86-96, February.
    4. Patrizia Beraldi & Andrzej Ruszczyński, 2002. "The Probabilistic Set-Covering Problem," Operations Research, INFORMS, vol. 50(6), pages 956-967, December.
    5. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    6. Wang, Yiyuan & Pan, Shiwei & Al-Shihabi, Sameh & Zhou, Junping & Yang, Nan & Yin, Minghao, 2021. "An improved configuration checking-based algorithm for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 294(2), pages 476-491.
    7. Brian Denton & Diwakar Gupta & Keith Jawahir, 2003. "Managing Increasing Product Variety at Integrated Steel Mills," Interfaces, INFORMS, vol. 33(2), pages 41-53, April.
    8. Bowers, M.R. & Kaplan, L.A. & Hooker, T.L., 1995. "A two-phase model for planning the production of aluminum ingot," European Journal of Operational Research, Elsevier, vol. 81(1), pages 105-114, February.
    9. Amadeu A. Coco & Andréa Cynthia Santos & Thiago F. Noronha, 2022. "Robust min-max regret covering problems," Computational Optimization and Applications, Springer, vol. 83(1), pages 111-141, September.
    10. Lu Yang & Leishan Zhou & Hanxiao Zhou & Chang Han & Wenqiang Zhao, 2023. "A Lagrangian Method for Calculation of Passing Capacity on a Railway Hub Station," Mathematics, MDPI, vol. 11(6), pages 1-20, March.
    11. Vié, Marie-Sklaerder & Zufferey, Nicolas & Cordeau, Jean-François, 2019. "Solving the Wire-Harness Design Problem at a European car manufacturer," European Journal of Operational Research, Elsevier, vol. 272(2), pages 712-724.
    12. Renata Mansini & Roberto Zanotti, 2020. "A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 1061-1079, October.
    13. Alberto Caprara & Matteo Fischetti & Paolo Toth, 1999. "A Heuristic Method for the Set Covering Problem," Operations Research, INFORMS, vol. 47(5), pages 730-743, October.
    14. P N Ram Kumar & T T Narendran, 2011. "On the usage of Lagrangean Relaxation for the convoy movement problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 722-728, April.
    15. Sven de Vries & Rakesh V. Vohra, 2003. "Combinatorial Auctions: A Survey," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 284-309, August.
    16. Kroon, L.G. & Fischetti, M., 2000. "Crew Scheduling for Netherlands Railways: "destination: customer"," ERIM Report Series Research in Management ERS-2000-56-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.

    More about this item

    Keywords

    Location set covering problem; heuristics;

    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:2:y:1994:i:2:p:315-328. 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.