{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T13:07:05Z","timestamp":1769605625777,"version":"3.49.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Mathematics and Artificial Intelligence"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1023\/a:1014492408220","type":"journal-article","created":{"date-parts":[[2002,12,29]],"date-time":"2002-12-29T19:13:07Z","timestamp":1041189187000},"page":"291-311","source":"Crossref","is-referenced-by-count":27,"title":["Embedding Relaxations in Global Constraints for Solving TSP and TSPTW"],"prefix":"10.1007","volume":"34","author":[{"given":"Filippo","family":"Focacci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Lodi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michela","family":"Milano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"394700_CR1","unstructured":"N. Ascheuer, M. Fischetti and M. Gr\u00f6tschel, Solving ATSP with time windows by branch-and-cut, Math. Programming (2001), to appear."},{"key":"394700_CR2","unstructured":"E. Balas and N. Simonetti, Linear time dynamic programming algorithms for some classes of restricted TSP's (1996), unpublished."},{"key":"394700_CR3","unstructured":"E. Balas and P. Toth, Branch and bound methods, in: The Travelling Salesman Problem, eds. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys (John Wiley and Sons, 1985)."},{"key":"394700_CR4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N. Beldiceanu","year":"1994","unstructured":"N. Beldiceanu and E. Contejean, Introducing global constraints in CHIP, Math. Comput. Modelling 20 (1994) 97-123.","journal-title":"Math. Comput. Modelling"},{"key":"394700_CR5","unstructured":"H. Beringer and B. De Backer, Combinatorial problem solving in constraint logic programming with cooperating solvers, in: Logic Programming: Formal Methods and Practical Applications, eds. C. Beierle and L. Plumer (North Holland, 1995)."},{"key":"394700_CR6","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J. Carlier","year":"1995","unstructured":"J. Carlier and E. Pinson, An algorithm for solving job shop scheduling, Management Sci. 35 (1995) 164-176.","journal-title":"Management Sci."},{"key":"394700_CR7","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02288323","volume":"13","author":"G. Carpaneto","year":"1988","unstructured":"G. Carpaneto, S. Martello and P. Toth, Algorithms and codes for the assignment problem, Ann. Oper. Res. 13 (1988) 193-223.","journal-title":"Ann. Oper. Res."},{"key":"394700_CR8","doi-asserted-by":"crossref","unstructured":"Y. Caseau and F. Laburthe, Solving small TSPs with constraints, in: Proceedings of ICLP '97 (1997).","DOI":"10.7551\/mitpress\/4299.003.0028"},{"key":"394700_CR9","doi-asserted-by":"crossref","unstructured":"Y. Caseau and F. Laburthe, Solving various weighted matching problems with constraints, in: Proceedings of CP '97 (1997).","DOI":"10.1007\/BFb0017427"},{"key":"394700_CR10","unstructured":"M. Dell'Amico and S. Martello, Linear assignment, in: Annotated Bibliographies in Combinatorial Optimization, eds. M. Dell'Amico, F. Maffioli and S. Martello (Wiley, 1997)."},{"key":"394700_CR11","unstructured":"M. Dincbas, P. Van Hentenryck and H. Simonis, Solving the car sequencing problems in Constraint Logic Programming, in: Proceedings of ECAI '88 (1988)."},{"key":"394700_CR12","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0743-1066(90)90052-7","volume":"8","author":"M. Dincbas","year":"1990","unstructured":"M. Dincbas, P. Van Hentenryck and M. Simonis, Solving large combinatorial problems in logic programming, J. Logic Programming 8 (1990) 75-93.","journal-title":"J. Logic Programming"},{"key":"394700_CR13","unstructured":"M. Dincbas, P. Van Hentenryck, M. Simonis, A. Aggoun, T. Graf and F. Berthier, The constraint logic programming language CHIP, in: Proceedings of the International Conference on Fifth Generation Computer System (1988)."},{"key":"394700_CR14","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1287\/opre.43.2.367","volume":"43","author":"Y. Dumas","year":"1995","unstructured":"Y. Dumas, J. Desrosiers, E. Gelinas and M.M. Solomon, An optimal algorithm for the traveling salesman problem with the time windows, Oper. Res. 43 (1995) 367-371.","journal-title":"Oper. Res."},{"key":"394700_CR15","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01585701","volume":"53","author":"M. Fischetti","year":"1992","unstructured":"M. Fischetti and P. Toth, An additive bounding procedure for the asymmetric traveling salesman problem, Math. Programming 53 (1992) 173-197.","journal-title":"Math. Programming"},{"key":"394700_CR16","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/ijoc.5.4.426","volume":"5","author":"M. Fischetti","year":"1993","unstructured":"M. Fischetti and P. Toth, An efficient algorithm for the min-sum arborescence problem on complete digraphs, ORSA J. Comput. 5 (1993) 426-434.","journal-title":"ORSA J. Comput."},{"key":"394700_CR17","doi-asserted-by":"crossref","unstructured":"F. Focacci, A. Lodi and M. Milano, Cost-based domain filtering, in: Proceedings of CP '99 (1999).","DOI":"10.1007\/978-3-540-48085-3_14"},{"key":"394700_CR18","unstructured":"F. Focacci, A. Lodi and M. Milano, Solving tsp with time windows with constraints, in: Proceedings of ICLP '99 (1999)."},{"key":"394700_CR19","unstructured":"M.T. Hajian, H. El-Sakkout, M. Wallace, J.M. Lever and E.B. Richards, Towards a closer integration of finite domain propagation and simplex-based algorithms, technical report, IC-Parc (1995)."},{"key":"394700_CR20","unstructured":"W.D. Harvey and M.L. Ginsberg, Limited discrepancy search, in: Proceedings of IJCAI '95 (1995)."},{"key":"394700_CR21","unstructured":"P. Van Hentenryck, Constraint Satisfaction in Logic Programming (MIT Press, 1989)."},{"key":"394700_CR22","unstructured":"ILOG, ILOG Scheduler 4.4 Reference Manual."},{"key":"394700_CR23","unstructured":"ILOG, ILOG Solver 4.4 Reference Manual."},{"key":"394700_CR24","unstructured":"M. J\u00fcnger, G. Reinelt and G. Rinaldi, The travelling salesman problem, in: Annotated Bibliographies in Combinatorial Optimization, eds. M. Dell'Amico, F. Maffioli and S. Martello (Wiley, 1997)."},{"key":"394700_CR25","unstructured":"C.H. Papadimitriou and K. Stieglitz, Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, 1982)."},{"key":"394700_CR26","unstructured":"L. Perron, Integration into constraint programming and parallelization of OR\/AI search methods, in: CP-AI-OR '99 Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (1999)."},{"key":"394700_CR27","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1287\/trsc.32.1.12","volume":"32","author":"G. Pesant","year":"1998","unstructured":"G. Pesant, M. Gendreau, J.Y. Potvin and J.M. Rousseau, An exact constraint logic programming algorithm for the traveling salesman problem with time windows, Transportation Sci. 32 (1998) 12-29.","journal-title":"Transportation Sci."},{"key":"394700_CR28","unstructured":"J.F. Puget, A C++ implementation of CLP, technical report 94-01 (ILOG Headquarters, 1994)."},{"key":"394700_CR29","unstructured":"J.C. R\u00e9gin, A filtering algorithm for constraints of difference in CSPs, in: Proceedings of AAAI '94 (1994)."},{"key":"394700_CR30","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y. Rochat","year":"1995","unstructured":"Y. Rochat and E.D. Taillard, Probabilistic diversification and intensification in local search for vehicle routing, J. Heuristics 1 (1995) 147-167.","journal-title":"J. Heuristics"},{"key":"394700_CR31","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1018904229454","volume":"86","author":"R. Rodosek","year":"1999","unstructured":"R. Rodosek, M. Wallace and M.T. Hajian, A new approach to integrating mixed integer programming and constraint logic programming, Ann. Oper. Res. 86 (1999) 63-87.","journal-title":"Ann. Oper. Res."},{"key":"394700_CR32","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02022044","volume":"4","author":"M.W.P. Savelsberg","year":"1985","unstructured":"M.W.P. Savelsberg, Local search in routing poblem with time windows, Ann. Oper. Res. 4 (1985) 285-305.","journal-title":"Ann. Oper. Res."},{"key":"394700_CR33","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M.M. Solomon","year":"1987","unstructured":"M.M. Solomon, Algorithms for the vehicle routing and scheduling problem with time window constraints, Oper. Res. 35 (1987) 254-265.","journal-title":"Oper. Res."},{"key":"394700_CR34","unstructured":"E.D. Taillard, P. Badeau, M. Gendreau, F. Guertin and J.-Y. Potvin, A new neighborhood structure for the vehicle routing problems with time windows (1995), unpublished."},{"key":"394700_CR35","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF00143881","volume":"1","author":"M. Wallace","year":"1996","unstructured":"M. Wallace, Practical applications of constraint programming, Constraints 1 (1996) 139-168.","journal-title":"Constraints"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1014492408220.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1014492408220\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1014492408220.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:33:33Z","timestamp":1747546413000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1014492408220"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["394700"],"URL":"https:\/\/doi.org\/10.1023\/a:1014492408220","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}