Abstract
In many applications, such as telecommunications and routing, we seek for cost-effective infrastructure or operating layouts so that many nodes (e.g., customers) of a support network (typically modeled by a graph) are covered by, or at least are easily reachable from, such a layout. In this paper, we study the maximum covering cycle problem. In this problem we are given a non-complete graph, and the goal is to find a cycle, such that the number of nodes which are either on the cycle or are adjacent to the cycle is maximized. We design a branch-and-cut framework for solving the problem. The framework contains valid inequalities, lifted inequalities and a primal heuristic. In a computational study, we compare our framework to previous work available for this problem. The results reveal that our approach significantly outperforms the previous approach. In particular, all available instances from the literature could be solved to optimality with our approach, most of them within a few seconds.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aazami, A. (2010). Domination in graphs with bounded propagation: Algorithms, formulations and hardness results. Journal of combinatorial optimization, 19(4), 429–456.
Arkin, E., & Hassin, R. (1994). Approximation algorithms for the geometric covering salesman problem. Discrete Applied Mathematics, 55(3), 197–218.
Balas, E. (1989). The asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph. SIAM Journal on Discrete Mathematics, 2(4), 425–451.
Bley, A., Ljubić, I., & Maurer, O. (2017). A node-based ilp formulation for the node-weighted dominating steiner problem. Networks, 69(1), 33–51.
Colbourn, C., & Stewart, L. (1991). Permutation graphs: Connected domination and Steiner trees. In S. Hedetniemi (Ed.), Topics on Domination (Vol. 48, pp. 179–189)., Annals of Discrete Mathematics New York: Elsevier.
Current, J., & Schilling, D. (1989). The covering salesman problem. Transportation Science, 23(3), 208–213.
Current, J., & Schilling, D. (1994). The median tour and maximal covering tour problems: Formulations and heuristics. European Journal of Operational Research, 73(1), 114–126.
Dantzig, G., Fulkerson, R., & Johnson, S. (1954). Solution of a large-scale traveling-salesman problem. Journal of the Operations Research Society of America, 2(4), 393–410.
Fischetti, M., Salazar-González, J.-J., & Toth, P. (1997). A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Operations Research, 45(3), 378–394.
Fischetti, M., Salazar-González, J., & Toth, P. (1999). Solving the orienteering problem through branch-and-cut. INFORMS Journal on Computing, 10, 133–148.
Fischetti, M., Leitner, M., Ljubić, I., Luipersbeck, M., Monaci, M., Resch, M., et al. (2017). Thinning out steiner trees: A node-based model for uniform edge costs. Mathematical Programming Computation, 9(2), 203–229.
Gendreau, M., Laporte, G., & Semet, F. (1997). The covering tour problem. Operations Research, 45(4), 568–576.
Gendron, B., Lucena, A., da Cunha, A., & Simonetti, L. (2014). Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem. INFORMS Journal on Computing, 26(4), 645–657.
Golden, B., Naji-Azimi, Z., Raghavan, S., Salari, M., & Toth, P. (2012). The generalized covering salesman problem. INFORMS Journal on Computing, 24(4), 534–553.
Gollowitzer, S., & Ljubić, I. (2011). Mip models for connected facility location: A theoretical and computational study. Computers & Operations Research, 38(2), 435–449.
Grosso, A., Salassa, F., & Vancroonenburg, W. (2016). Searching for a cycle with maximum coverage in undirected graphs. Optimization Letters, 10(7), 1493–1504.
Haynes, T., Hedetniemi, S., & Slater, P. (1998). Fundamentals of domination in graphs (1st ed.)., Pure and applied mathematics Boca Raton: CRC Press.
Hoffman, K., Padberg, M., & Rinaldi, G. (2013). Traveling salesman problem. Encyclopedia of operations research and management science (pp. 1573–1578). Berlin: Springer.
Jeong, I. (2017). An optimal approach for a set covering version of the refueling-station location problem and its application to a diffusion model. International Journal of Sustainable Transportation, 11(2), 86–97.
Jozefowiez, N., Semet, F., & Talbi, E. (2007). The bi-objective covering tour problem. Computers & Operations research, 34(7), 1929–1942.
Koch, T., & Martin, A. (1998). Solving steiner tree problems in graphs to optimality. Networks, 32(3), 207–232.
Koch, T., Martin, A., & Voß, S. (2001). SteinLib: An updated library on Steiner tree problems in graphs. Steiner trees in industry, 11, 285–326.
Kratochv, J., Proskurowski, A., & Telle, J. (1998). Complexity of graph covering problems. Nordic Journal of Computing, 5, 173–195.
Kruskal, J. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7(1), 48–50.
Leitner, M., Ljubić, I., Salazar-González, J.-J., & Sinnl, M. (2017). An algorithmic framework for the exact solution of tree-star problems. European Journal of Operational Research, 261(1), 54–66.
Ozbaygin, G., Yaman, H., & Karasan, O. (2016). Time constrained maximal covering salesman problem with weighted demands and partial coverage. Computers & Operations Research, 76, 226–237.
Shaelaie, M., Salari, M., & Naji-Azimi, Z. (2014). The generalized covering traveling salesman problem. Applied Soft Computing, 24, 867–878.
Acknowledgements
E. Álvarez-Miranda acknowledges the support of the Chilean Council of Scientific and Technological Research, CONICYT, through the FONDECYT Grant N.1180670 and through the Complex Engineering Systems Institute (ICM-FIC:P-05-004-F, CONICYT:FB0816). The research of M. Sinnl was supported by the Austrian Research Fund (FWF, Project P 26755-N19).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Álvarez-Miranda, E., Sinnl, M. A branch-and-cut algorithm for the maximum covering cycle problem. Ann Oper Res 284, 487–499 (2020). https://doi.org/10.1007/s10479-018-2856-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-018-2856-5