IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v8y2004i3d10.1023_bjoco.0000038916.51082.5e.html
   My bibliography  Save this article

Even Cycles and Perfect Matching Problems with Side Constraints

Author

Listed:
  • Elena Fernández

    (Universitat Politècnica de Catalunya)

  • Oscar Meza

    (Simón Bolívar University)

Abstract

We study two different types of graphs that contain even cycles and, possibly, some chords. The objective is to analyze some properties of these types of graphs that can be used to solve perfect matching optimization problems with side constraints. In particular, we obtain the maximum number of edges of certain classes that can occur in the solutions to the considered problems. Finally, we apply the obtained results to derive a class of valid inequalities and a possible enumerative scheme.

Suggested Citation

  • Elena Fernández & Oscar Meza, 2004. "Even Cycles and Perfect Matching Problems with Side Constraints," Journal of Combinatorial Optimization, Springer, vol. 8(3), pages 381-396, September.
    • Handle: RePEc:spr:jcomop:v:8:y:2004:i:3:d:10.1023_b:joco.0000038916.51082.5e
    DOI: 10.1023/B:JOCO.0000038916.51082.5e
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/B:JOCO.0000038916.51082.5e
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/B:JOCO.0000038916.51082.5e?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. Michael Ball & Lawrence Bodin & Robert Dial, 1983. "A Matching Based Heuristic for Scheduling Mass Transit Crews and Vehicles," Transportation Science, INFORMS, vol. 17(1), pages 4-31, February.
    2. Elena Fernández & Oscar Meza & Robert Garfinkel & Maruja Ortega, 2003. "On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation," Operations Research, INFORMS, vol. 51(2), pages 281-291, April.
    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. Angel Corberán & Gustavo Mejía & José M. Sanchis, 2005. "New Results on the Mixed General Routing Problem," Operations Research, INFORMS, vol. 53(2), pages 363-376, April.
    2. William Cook & André Rohe, 1999. "Computing Minimum-Weight Perfect Matchings," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 138-148, May.
    3. 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.
    4. Perumal, S.S.G. & Dollevoet, T.A.B. & Huisman, D. & Lusby, R.M. & Larsen, J. & Riis, M., 2020. "Solution Approaches for Vehicle and Crew Scheduling with Electric Buses," Econometric Institute Research Papers EI-2020-02, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    5. Aráoz, Julián & Fernández, Elena & Meza, Oscar, 2009. "Solving the Prize-collecting Rural Postman Problem," European Journal of Operational Research, Elsevier, vol. 196(3), pages 886-896, August.
    6. Julián Aráoz & Elena Fernández & Carles Franquesa, 2009. "The Clustered Prize-Collecting Arc Routing Problem," Transportation Science, INFORMS, vol. 43(3), pages 287-300, August.
    7. Shen, Yindong & Xu, Jia & Li, Jingpeng, 2016. "A probabilistic model for vehicle scheduling based on stochastic trip times," Transportation Research Part B: Methodological, Elsevier, vol. 85(C), pages 19-31.
    8. Chew, Joanne S.C. & Zhang, Lele & Gan, Heng S., 2019. "Optimizing limited-stop services with vehicle assignment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 129(C), pages 228-246.
    9. Knut Haase & Guy Desaulniers & Jacques Desrosiers, 2001. "Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems," Transportation Science, INFORMS, vol. 35(3), pages 286-303, August.
    10. Niu, Huimin & Zhou, Xuesong & Tian, Xiaopeng, 2018. "Coordinating assignment and routing decisions in transit vehicle schedules: A variable-splitting Lagrangian decomposition approach for solution symmetry breaking," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 70-101.
    11. Chu, Sydney C.K., 2007. "Generating, scheduling and rostering of shift crew-duties: Applications at the Hong Kong International Airport," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1764-1778, March.
    12. Elena Fernández & Jessica Rodríguez-Pereira, 2017. "Multi-depot rural postman problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(2), pages 340-372, July.
    13. Markó Horváth & Tamás Kis, 2019. "Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(1), pages 39-67, March.
    14. Ingmar Steinzen & Vitali Gintner & Leena Suhl & Natalia Kliewer, 2010. "A Time-Space Network Approach for the Integrated Vehicle- and Crew-Scheduling Problem with Multiple Depots," Transportation Science, INFORMS, vol. 44(3), pages 367-382, August.
    15. Haghani, Ali & Banihashemi, Mohamadreza, 2002. "Heuristic approaches for solving large-scale bus transit vehicle scheduling problem with route time constraints," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(4), pages 309-333, May.
    16. 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.
    17. Wang, Mengtong & Chen, Shukai & Meng, Qiang, 2024. "Robust safety driver scheduling for autonomous buses," Transportation Research Part B: Methodological, Elsevier, vol. 184(C).
    18. Perumal, Shyam S.G. & Larsen, Jesper & Lusby, Richard M. & Riis, Morten & Sørensen, Kasper S., 2019. "A matheuristic for the driver scheduling problem with staff cars," European Journal of Operational Research, Elsevier, vol. 275(1), pages 280-294.
    19. Kuo, Yong-Hong & Leung, Janny M.Y. & Yan, Yimo, 2023. "Public transport for smart cities: Recent innovations and future challenges," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1001-1026.
    20. 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.

    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:jcomop:v:8:y:2004:i:3:d:10.1023_b:joco.0000038916.51082.5e. 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.