A Linear Time Algorithm for the k-Cutset Constraint

Authors Nicolas Isoart, Jean-Charles Régin

Thumbnail PDF


  • Filesize: 1.27 MB
  • 16 pages

Document Identifiers

Author Details

Nicolas Isoart
  • Université Côte d'Azur, Nice, France
Jean-Charles Régin
  • Université Côte d'Azur, Nice, France

Cite AsGet BibTex

Nicolas Isoart and Jean-Charles Régin. A Linear Time Algorithm for the k-Cutset Constraint. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 29:1-29:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)


In CP, the most efficient model solving the TSP is the Weighted Circuit Constraint (WCC) combined with the k-cutset constraint. The WCC is mainly based on the edges cost of a given graph whereas the k-cutset constraint is a structural constraint. Specifically, for each cutset in a graph, the k-cutset constraint imposes that the size of the cutset is greater than or equal to two. In addition, any solution contains an even number of elements from this cutset. Isoart and Régin introduced an algorithm for this constraint. Unfortunately, their approach leads to a time complexity growing with the size of the considered cutsets, i.e. with k. Thus, they introduced an algorithm with a quadratic complexity dealing with k lower or equal to three. In this paper, we introduce a linear time algorithm for any k based on a DFS checking the consistency of this constraint and performing its filtering. Experimental results show that the size of most of the k-cutsets is lower or equal than 3. In addition, since the time complexity is improved, our algorithm also improves the solving times.

Subject Classification

ACM Subject Classification
  • Theory of computation → Constraint and logic programming
  • k-Cutset
  • TSP
  • Linear algorithm
  • Constraint


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. David L Applegate, Robert E Bixby, Vasek Chvatal, and William J Cook. The traveling salesman problem: a computational study. Princeton university press, 2006. Google Scholar
  2. Pascal Benchimol, Willem-Jan Van Hoeve, Jean-Charles Régin, Louis-Martin Rousseau, and Michel Rueher. Improved filtering for weighted circuit constraints. Constraints, 17(3):205-233, 2012. URL: https://hal.archives-ouvertes.fr/hal-01344070.
  3. Václav Chvátal. Edmonds polytopes and weakly hamiltonian graphs. Math. Program., 5(1):29-40, 1973. URL: https://doi.org/10.1007/BF01580109.
  4. Jack Edmonds. Paths, Trees, and Flowers. Canadian Journal of Mathematics, 17:449–467, 1965. URL: https://doi.org/10.4153/CJM-1965-045-4.
  5. Jean-Guillaume Fages, Xavier Lorca, and Louis-Martin Rousseau. The salesman and the tree: the importance of search in CP. Constraints, 21(2):145-162, 2016. Google Scholar
  6. Martin Grötschel and Manfred Padberg. On the symmetric travelling salesman problem i: Inequalities. Mathematical Programming, 16:265-280, December 1979. URL: https://doi.org/10.1007/BF01582116.
  7. Robert Haralick and Gordon Elliott. Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artificial Intelligence, 14:263-313, January 1979. Google Scholar
  8. Michael Held and Richard M. Karp. The traveling-salesman problem and minimum spanning trees. Operations Research, 18(6):1138-1162, 1970. Google Scholar
  9. Michael Held and Richard M. Karp. The traveling-salesman problem and minimum spanning trees: Part ii. Mathematical Programming, 1(1):6-25, 1971. Google Scholar
  10. Nicolas Isoart and Jean-Charles Régin. Integration of structural constraints into tsp models. In Thomas Schiex and Simon de Givry, editors, Principles and Practice of Constraint Programming, pages 284-299, Cham, 2019. Springer International Publishing. Google Scholar
  11. Nicolas Isoart and Jean-Charles Régin. Adaptive CP-Based Lagrangian Relaxation for TSP Solving. In Emmanuel Hebrard and Nysret Musliu, editors, Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pages 300-316, Cham, 2020. Springer International Publishing. Google Scholar
  12. Christophe Lecoutre, Lakhdar Saïs, Sébastien Tabary, and Vincent Vidal. Reasoning from last conflict(s) in constraint programming. Artificial Intelligence, 173(18):1592-1614, 2009. Google Scholar
  13. Adam N. Letchford and Andrea Lodi. Polynomial-Time Separation of Simple Comb Inequalities. In William J. Cook and Andreas S. Schulz, editors, Integer Programming and Combinatorial Optimization, pages 93-108, Berlin, Heidelberg, 2002. Springer Berlin Heidelberg. Google Scholar
  14. Gerhard Reinelt. TSPLIB - A Traveling Salesman Problem Library. ORSA Journal on Computing, 3(4):376-384, 1991. Google Scholar
  15. Meinolf Sellmann. Theoretical Foundations of CP-Based Lagrangian Relaxation. In Principles and Practice of Constraint Programming - CP 2004, 10th International Conference, CP 2004, Toronto, Canada, September 27 - October 1, 2004, Proceedings, pages 634-647, 2004. Google Scholar
  16. Robert E. Tarjan. A note on finding the bridges of a graph. Inf. Process. Lett., 2:160-161, 1974. Google Scholar
  17. Robert E. Tarjan. Data Structures and Network Algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics, 1983. Google Scholar
  18. Yung H. Tsin. Yet another optimal algorithm for 3-edge-connectivity. Journal of Discrete Algorithms, 7(1):130-146, 2009. Selected papers from the 1st International Workshop on Similarity Search and Applications (SISAP). Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail