Skip to main content

Optimal Cycle Selections: An Experimental Assessment of Integer Programming Formulations

  • Conference paper
  • First Online:
Combinatorial Optimization (ISCO 2024)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14594))

Included in the following conference series:

  • 339 Accesses

Abstract

In this paper, we conduct numerical experiments to test the effectiveness of several integer programming formulations of the cycle selection problem. Specifically, we carry out experiments to identify a maximum weighted cycle selection in random or in structured digraphs. The results show that random instances are relatively easy and that two formulations outperform the other ones in terms of total running time. We also examine variants of the problem obtained by adding a budget constraint and/or a maximum cycle length constraint. These variants are more challenging, especially when a budget constraint is imposed. To investigate the cycle selection problem with a maximum cycle length equal to 3, we provide an arc-based formulation with an exponential number of constraints that can be separated in polynomial time. All inequalities in the formulation are facet-defining for complete digraphs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Baratto, M.: Optimization models and methods for kidney transplantation programs, Ph.D. thesis, University of Liège (2024). https://hdl.handle.net/2268/314151

  2. Baratto, M., Crama, Y.: Cycle selections. Discret. Appl. Math. 335, 4–24 (2023)

    Article  MathSciNet  Google Scholar 

  3. Erdős, P., Rényi, A.: On random graphs I. Publicationes Mathematicae Debrecen 6, 290–297 (1959)

    Article  MathSciNet  Google Scholar 

  4. Fulkerson, D.R., Nemhauser, G.L., Trotter, L.E.: Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems. In: Balinski, M.L. (ed.) Approaches to Integer Programming. Mathematical Programming Studies, vol. 2, pp. 72–81. Springer, Berlin (1974). https://doi.org/10.1007/BFb0120689

    Chapter  Google Scholar 

  5. Graham, A.J., Pike, D.A.: A note on thresholds and connectivity in random directed graphs. Atlantic Electron. J. Math. 3, 1–5 (2008)

    MathSciNet  Google Scholar 

  6. Smeulders, B., Bartier, V., Crama, Y., Spieksma, F.: Recourse in kidney exchange programs. INFORMS J. Comput. 335, 4–24 (2021)

    Google Scholar 

  7. Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 146–160 (1972)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marie Baratto .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Baratto, M., Crama, Y. (2024). Optimal Cycle Selections: An Experimental Assessment of Integer Programming Formulations. In: Basu, A., Mahjoub, A.R., Salazar González, J.J. (eds) Combinatorial Optimization. ISCO 2024. Lecture Notes in Computer Science, vol 14594. Springer, Cham. https://doi.org/10.1007/978-3-031-60924-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-60924-4_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-60923-7

  • Online ISBN: 978-3-031-60924-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics