Formulations and branch-and-cut algorithms for cycle covers with up to p cycles
- 15 May 2025
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 327 (1) , 42-57
Abstract
No abstract availableFunding Information
- Foundation for Science and Technology (UIDB/04561/2020, UIDP/04561/2020, 2023.00825)
This publication has 23 references indexed in Scilit:
- Node based compact formulations for the Hamiltonian p‐median problemNetworks, 2023
- Compact formulations for multi-depot routing problems: Theoretical and computational comparisonsComputers & Operations Research, 2020
- A comparison of several models for the hamiltonian p‐median problemNetworks, 2014
- Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparisonEURO Journal on Transportation and Logistics, 2012
- A comparative analysis of several asymmetric traveling salesman problem formulationsComputers & Operations Research, 2009
- A result on projection for the vehicle routing problemEuropean Journal of Operational Research, 1995
- Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraintsOperations Research Letters, 1991
- The hamiltonian p-median problemEuropean Journal of Operational Research, 1990
- The prize collecting traveling salesman problemNetworks, 1989
- Hamiltonian location problemsEuropean Journal of Operational Research, 1983