David Applegate, Robert E. Bixby, Vasek Chvátal & William J. Cook (2001):
TSP Cuts Which Do Not Conform to the Template Paradigm.
In: Michael Jünger & Denis Naddef: Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School, SchloßDagstuhl, Germany, 15-19 May 2000],
Lecture Notes in Computer Science 2241.
Springer,
pp. 261–304,
doi:10.1007/3-540-45586-8_7.
Sanjeev Arora (1996):
Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems.
In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996.
IEEE Computer Society,
pp. 2–11,
doi:10.1109/SFCS.1996.548458.
N Beldiceanu & E Contejean (1994):
Introducing Global Constraints in CHIP.
Math. Comput. Model. 20(12),
pp. 97–123,
doi:10.1016/0895-7177(94)90127-9.
Pascal Benchimol, Willem Jan van Hoeve, Jean-Charles Régin, Louis-Martin Rousseau & Michel Rueher (2012):
Improved filtering for weighted circuit constraints.
Constraints An Int. J. 17(3),
pp. 205–233,
doi:10.1007/s10601-012-9119-x.
Alessandro Bertagnon & Marco Gavanelli (2020):
Improved Filtering for the Euclidean Traveling Salesperson Problem in CLP(FD).
In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020, New York, NY, USA, February 7-12, 2020.
AAAI Press,
pp. 1412–1419,
doi:10.1609/aaai.v34i02.5498 0.
Yves Caseau & François Laburthe (1997):
Solving Small TSPs with Constraints.
In: Lee Naish: Logic Programming, Proceedings of the Fourteenth International Conference on Logic Programming, Leuven, Belgium, July 8-11, 1997.
MIT Press,
pp. 316–330,
doi:10.7551/mitpress/4299.003.0028.
Michel Deudon, Pierre Cournut, Alexandre Lacoste, Yossiri Adulyasak & Louis-Martin Rousseau (2018):
Learning Heuristics for the TSP by Policy Gradient.
In: Willem Jan van Hoeve: Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 15th International Conference, CPAIOR 2018, Delft, The Netherlands, June 26-29, 2018, Proceedings,
Lecture Notes in Computer Science 10848.
Springer,
pp. 170–181,
doi:10.1007/978-3-319-93031-2_12.
Grégoire Dooms, Yves Deville & Pierre Dupont (2005):
CP(Graph): Introducing a Graph Computation Domain in Constraint Programming.
In: Peter van Beek: Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings,
Lecture Notes in Computer Science 3709.
Springer,
pp. 211–225,
doi:10.1007/11564751_18.
Jean-Guillaume Fages & Xavier Lorca (2012):
Improving the Asymmetric TSP by Considering Graph Structure.
CoRR abs/1206.3437.
Jean-Guillaume Fages, Xavier Lorca & Louis-Martin Rousseau (2016):
The salesman and the tree: the importance of search in CP.
Constraints 21(2),
pp. 145–162,
doi:10.1007/s10601-014-9178-2.
Matteo Fischetti & Paolo Toth (1992):
An additive bounding procedure for the asymmetric travelling salesman problem.
Math. Program. 53,
pp. 173–197,
doi:10.1007/BF01585701.
Filippo Focacci, Andrea Lodi & Michela Milano (2002):
Embedding Relaxations in Global Constraints for Solving TSP and TSPTW.
Ann. Math. Artif. Intell. 34(4),
pp. 291–311,
doi:10.1023/A:1014492408220.
Filippo Focacci, Andrea Lodi & Michela Milano (2002):
A Hybrid Exact Algorithm for the TSPTW.
INFORMS Journal on Computing 14(4),
pp. 403–417,
doi:10.1287/ijoc.14.4.403.2827.
Kathryn Glenn Francis & Peter J. Stuckey (2014):
Explaining circuit propagation.
Constraints 19(1),
pp. 1–29,
doi:10.1007/s10601-013-9148-0.
M. R. Garey, R. L. Graham & D. S. Johnson (1976):
Some NP-complete Geometric Problems.
In: Proceedings of the Eighth Annual ACM Symposium on Theory of Computing,
STOC '76.
ACM,
New York, NY, USA,
pp. 10–22,
doi:10.1145/800113.803626.
Michael Held & Richard M. Karp (1970):
The Traveling-Salesman Problem and Minimum Spanning Trees.
Operations Research 18(6),
pp. 1138–1162,
doi:10.1287/opre.18.6.1138.
Keld Helsgaun (2000):
An effective implementation of the Lin-Kernighan traveling salesman heuristic.
European Journal of Operational Research 126(1),
pp. 106–130,
doi:10.1016/S0377-2217(99)00284-2.
Nicolas Isoart & Jean-Charles Régin (2019):
Integration of Structural Constraints into TSP Models.
In: Thomas Schiex & Simon de Givry: Principles and Practice of Constraint Programming - 25th International Conference, CP 2019, Stamford, CT, USA, September 30 - October 4, 2019, Proceedings,
Lecture Notes in Computer Science 11802.
Springer,
pp. 284–299,
doi:10.1007/978-3-030-30048-7_17.
Richard M. Karp (1972):
Reducibility Among Combinatorial Problems.
In: Raymond E. Miller & James W. Thatcher: Proceedings of a symposium on the Complexity of Computer Computations, held March 20-22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, USA,
The IBM Research Symposia Series.
Plenum Press, New York,
pp. 85–103,
doi:10.1007/978-1-4684-2001-2_9.
Latife Genç Kaya & John N. Hooker (2006):
A Filter for the Circuit Constraint.
In: Frédéric Benhamou: Principles and Practice of Constraint Programming - CP 2006, 12th International Conference, CP 2006, Nantes, France, September 25-29, 2006, Proceedings,
Lecture Notes in Computer Science 4204.
Springer,
pp. 706–710,
doi:10.1007/11889205_55.
Thierry Le Provost & Mark Wallace (1993):
Generalized Constraint Propagation over the CLP Scheme.
J. Log. Program. 16(3),
pp. 319–359,
doi:10.1016/0743-1066(93)90047-K.
S. Lin & Brian W. Kernighan (1973):
An Effective Heuristic Algorithm for the Traveling-Salesman Problem.
Operations Research 21(2),
pp. 498–516,
doi:10.1287/opre.21.2.498.
Joseph S. B. Mitchell (1999):
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems.
SIAM J. Comput. 28(4),
pp. 1298–1309,
doi:10.1137/S0097539796309764.
Gilles Pesant, Michel Gendreau, Jean-Yves Potvin & Jean-Marc Rousseau (1998):
An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows.
Transportation Science 32(1),
pp. 12–29,
doi:10.1287/trsc.32.1.12.
Jean-Charles Régin (1994):
A Filtering Algorithm for Constraints of Difference in CSPs.
In: Barbara Hayes-Roth & Richard E. Korf: Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31 - August 4, 1994, Volume 1..
AAAI Press / The MIT Press,
pp. 362–367.
Gerhard Reinelt (1991):
TSPLIB - A Traveling Salesman Problem Library.
INFORMS Journal on Computing 3(4),
pp. 376–384,
doi:10.1287/ijoc.3.4.376.
Joachim Schimpf & Kish Shen (2012):
ECL^\voidb@x iPS^\voidb@x e - From LP to CLP.
Theory Pract. Log. Program. 12(1-2),
pp. 127–156,
doi:10.1017/S1471068411000469.
Neng-Fa Zhou (2009):
Encoding Table Constraints in CLP(FD) Based on Pair-Wise AC.
In: Patricia M. Hill & David Scott Warren: Logic Programming, 25th International Conference, ICLP 2009, Pasadena, CA, USA, July 14-17, 2009. Proceedings,
Lecture Notes in Computer Science 5649.
Springer,
pp. 402–416,
doi:10.1007/978-3-642-02846-5_33.
eptcs@eptcs.org