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

Graph theoretic relaxations of set covering and set partitioning problems

Author

Listed:
  • El-Darzi, Elia
  • Mitra, Gautam

Abstract

No abstract is available for this item.

Suggested Citation

  • El-Darzi, Elia & Mitra, Gautam, 1995. "Graph theoretic relaxations of set covering and set partitioning problems," European Journal of Operational Research, Elsevier, vol. 87(1), pages 109-121, November.
    • Handle: RePEc:eee:ejores:v:87:y:1995:i:1:p:109-121
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)00115-S
    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. Mark S. Daskin & Edmund H. Stern, 1981. "A Hierarchical Objective Set Covering Model for Emergency Medical Service Vehicle Deployment," Transportation Science, INFORMS, vol. 15(2), pages 137-152, May.
    2. Darby-Dowman, K. & Mitra, G., 1985. "An extension of set partitioning with application to scheduling problems," European Journal of Operational Research, Elsevier, vol. 21(2), pages 200-205, August.
    3. El-Darzi, E & Mitra, G, 1990. "Set covering and set partitioning: A collection of test problems," Omega, Elsevier, vol. 18(2), pages 195-201.
    4. Beasley, J. E., 1987. "An algorithm for set covering problem," European Journal of Operational Research, Elsevier, vol. 31(1), pages 85-93, July.
    5. Ali, Agha Iqbal & Thiagarajan, Hemalatha, 1989. "A network relaxation based enumeration algorithm for set partitioning," European Journal of Operational Research, Elsevier, vol. 38(1), pages 76-85, January.
    6. Ribeiro, Celso Carneiro & Minoux, Michel & Penna, Manoel Camillo, 1989. "An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment," European Journal of Operational Research, Elsevier, vol. 41(2), pages 232-239, July.
    7. Baker, Edward & Fisher, Michael, 1981. "Computational results for very large air crew scheduling problems," Omega, Elsevier, vol. 9(6), pages 613-618.
    8. Lavoie, Sylvie & Minoux, Michel & Odier, Edouard, 1988. "A new approach for crew pairing problems by column generation with an application to air transportation," European Journal of Operational Research, Elsevier, vol. 35(1), pages 45-58, April.
    9. Marshall L. Fisher & Pradeep Kedia, 1990. "Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics," Management Science, INFORMS, vol. 36(6), pages 674-688, June.
    10. Fred Shepardson & Roy E. Marsten, 1980. "A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem," Management Science, INFORMS, vol. 26(3), pages 274-281, March.
    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. Friberg, Christian & Haase, Knut, 1996. "An exact algorithm for the vehicle and crew scheduling problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 416, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    2. Chiou, Yu-Chiun & Lan, Lawrence W., 2001. "Genetic clustering algorithms," European Journal of Operational Research, Elsevier, vol. 135(2), pages 413-427, December.
    3. Bersani, Chiara & Minciardi, Riccardo & Sacile, Roberto & Trasforini, Eva, 2009. "Network planning of fuelling service stations in a near-term competitive scenario of the hydrogen economy," Socio-Economic Planning Sciences, Elsevier, vol. 43(1), pages 55-71, March.
    4. Cochran, Jeffery K. & Marquez Uribe, Alberto, 2005. "A set covering formulation for agile capacity planning within supply chains," International Journal of Production Economics, Elsevier, vol. 95(2), pages 139-149, February.

    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. Zeren, Bahadır & Özcan, Ender & Deveci, Muhammet, 2024. "An adaptive greedy heuristic for large scale airline crew pairing problems," Journal of Air Transport Management, Elsevier, vol. 114(C).
    2. 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.
    3. 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.
    4. Victor Reyes & Ignacio Araya, 2021. "A GRASP-based scheme for the set covering problem," Operational Research, Springer, vol. 21(4), pages 2391-2408, December.
    5. Beasley, J. E. & Cao, B., 1996. "A tree search algorithm for the crew scheduling problem," European Journal of Operational Research, Elsevier, vol. 94(3), pages 517-526, November.
    6. Christian Prins & Caroline Prodhon & Roberto Calvo, 2006. "Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem," Annals of Operations Research, Springer, vol. 147(1), pages 23-41, October.
    7. A. Mingozzi & M. A. Boschetti & S. Ricciardelli & L. Bianco, 1999. "A Set Partitioning Approach to the Crew Scheduling Problem," Operations Research, INFORMS, vol. 47(6), pages 873-888, December.
    8. Larry W. Jacobs & Michael J. Brusco, 1995. "Note: A local‐search heuristic for large set‐covering problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(7), pages 1129-1140, October.
    9. Stephen E. Bechtold & Larry W. Jacobs, 1996. "The equivalence of general set‐covering and implicit integer programming formulations for shift scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(2), pages 233-249, March.
    10. Zeghal, F.M. & Minoux, M., 2006. "Modeling and solving a Crew Assignment Problem in air transportation," European Journal of Operational Research, Elsevier, vol. 175(1), pages 187-209, November.
    11. Parmentier, Axel & Meunier, Frédéric, 2020. "Aircraft routing and crew pairing: Updated algorithms at Air France," Omega, Elsevier, vol. 93(C).
    12. 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.
    13. 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.
    14. Gao, Chao & Yao, Xin & Weise, Thomas & Li, Jinlong, 2015. "An efficient local search heuristic with row weighting for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 246(3), pages 750-761.
    15. Sankaran, Jayaram K., 1995. "Column generation applied to linear programs in course registration," European Journal of Operational Research, Elsevier, vol. 87(2), pages 328-342, December.
    16. Helena R. Lourenço & José P. Paixão & Rita Portugal, 2001. "Multiobjective Metaheuristics for the Bus Driver Scheduling Problem," Transportation Science, INFORMS, vol. 35(3), pages 331-343, August.
    17. Wang, Dian & D’Ariano, Andrea & Zhao, Jun & Zhong, Qingwei & Peng, Qiyuan, 2022. "Integrated rolling stock deadhead routing and timetabling in urban rail transit lines," European Journal of Operational Research, Elsevier, vol. 298(2), pages 526-559.
    18. Sriram, Chellappan & Haghani, Ali, 2003. "An optimization model for aircraft maintenance scheduling and re-assignment," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(1), pages 29-48, January.
    19. Li, Xin & Pan, Yanchun & Jiang, Shiqiang & Huang, Qiang & Chen, Zhimin & Zhang, Mingxia & Zhang, Zuoyao, 2021. "Locate vaccination stations considering travel distance, operational cost, and work schedule," Omega, Elsevier, vol. 101(C).
    20. P. Daniel Wright & Matthew J. Liberatore & Robert L. Nydick, 2006. "A Survey of Operations Research Models and Applications in Homeland Security," Interfaces, INFORMS, vol. 36(6), pages 514-529, December.

    More about this item

    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:eee:ejores:v:87:y:1995:i:1:p:109-121. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.