{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:36:26Z","timestamp":1759667786671},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131929"},{"type":"electronic","value":"9783642131936"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13193-6_18","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T07:54:59Z","timestamp":1272354899000},"page":"202-213","source":"Crossref","is-referenced-by-count":6,"title":["The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm"],"prefix":"10.1007","author":[{"given":"Hern\u00e1n","family":"Abeledo","sequence":"first","affiliation":[]},{"given":"Ricardo","family":"Fukasawa","sequence":"additional","affiliation":[]},{"given":"Artur","family":"Pessoa","sequence":"additional","affiliation":[]},{"given":"Eduardo","family":"Uchoa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/opre.26.1.86","volume":"26","author":"J. Picard","year":"1978","unstructured":"Picard, J., Queyranne, M.: The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling. Operations Research\u00a026, 86\u2013110 (1978)","journal-title":"Operations Research"},{"key":"18_CR2","volume-title":"Mathematical Programming","author":"S. Vajda","year":"1961","unstructured":"Vajda, S.: Mathematical Programming. Addison-Wesley, Reading (1961)"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-0-387-77778-8_14","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges","author":"A. Pessoa","year":"2008","unstructured":"Pessoa, A., Poggi de Arag\u00e3o, M., Uchoa, E.: Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems. In: Golden, B., Raghavan, S., Wasil, E. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges, pp. 297\u2013326. Springer, New York (2008)"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/net.20330","volume":"54","author":"A. Pessoa","year":"2009","unstructured":"Pessoa, A., Uchoa, E., Poggi de Arag\u00e3o, M.: A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. Networks\u00a054, 167\u2013177 (2009)","journal-title":"Networks"},{"key":"18_CR5","unstructured":"Pessoa, A., Uchoa, E., Poggi de Arag\u00e3o, M., Freitas, R.: Algorithms over Arc-time Indexed Formulations for Single and Parallel Machine Scheduling Problems. Technical report RPEP\u00a08(8), Universidade Federal Fluminense, Engenharia de Produ\u00e7\u00e3o, Niter\u00f3i, Brazil (2008)"},{"key":"18_CR6","first-page":"117","volume-title":"The Traveling Salesman Problem and Its Variations","author":"E. Balas","year":"2002","unstructured":"Balas, E., Fischetti, M.: Polyhedral theory for the ATSP. In: Gutin, G., Punnen, A. (eds.) The Traveling Salesman Problem and Its Variations, pp. 117\u2013168. Kluwer, Dordrecht (2002)"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.disopt.2005.10.001","volume":"3","author":"E. Balas","year":"2006","unstructured":"Balas, E., Carr, R., Fischetti, M., Simonetti, N.: New Facets of the STS Polytope Generated from Known Facets of the ATS Polytope. Discrete Optimization\u00a03, 3\u201319 (2006)","journal-title":"Discrete Optimization"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Gouveia, L., Simonetti, L., Uchoa, E.: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs. Mathematical Programming (2009) (Online first)","DOI":"10.1007\/s10107-009-0297-2"},{"key":"18_CR9","first-page":"251","volume-title":"The Traveling Salesman Problem","author":"M. Groetschel","year":"1985","unstructured":"Groetschel, M., Padberg, M.W.: Polyhedral theory. In: Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds.) The Traveling Salesman Problem, pp. 251\u2013305. Wiley, Chichester (1985)"},{"key":"18_CR10","unstructured":"Miranda Bront, J.J., M\u00e9ndez-D\u00edaz, I., Zabala, P.: An Integer Programming Approach for the Time Dependent Traveling Saleman Problem. In: 23rd European Conference on Operational Research (2009)"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"1018","DOI":"10.1287\/opre.28.4.1018","volume":"28","author":"K. Fox","year":"1980","unstructured":"Fox, K., Gavish, B., Graves, S.: An N-Constraint Formulation of the (Time Dependent) Traveling Salesman Problem. Operations Research\u00a028, 1018\u20131021 (1980)","journal-title":"Operations Research"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0377-2217(93)E0238-S","volume":"83","author":"L. Gouveia","year":"1995","unstructured":"Gouveia, L., Voss, S.: A Classification of formulations for the (time-dependent) traveling salesman problem. European Journal of Operations Research\u00a083, 69\u201382 (1995)","journal-title":"European Journal of Operations Research"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1287\/trsc.29.2.167","volume":"29","author":"R.J. Vander Wiel","year":"1995","unstructured":"Vander Wiel, R.J., Sahinidis, N.V.: Heuristics Bounds and Test Problem Generation for the time-dependent traveling salesman problem. Transportation Science\u00a029, 167\u2013183 (1995)","journal-title":"Transportation Science"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/j.disopt.2008.04.001","volume":"5","author":"L.-P. Bigras","year":"2008","unstructured":"Bigras, L.-P., Gamache, M., Savard, G.: The Time-Dependent Traveling Salesman Problem and Single Machine Scheduling Problems with Sequence Dependent Setup Time. Discrete Optimization\u00a05, 685\u2013699 (2008)","journal-title":"Discrete Optimization"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1002\/(SICI)1520-6750(199609)43:6<797::AID-NAV2>3.0.CO;2-#","volume":"43","author":"R.J. Vander Wiel","year":"1996","unstructured":"Vander Wiel, R.J., Sahinidis, N.V.: An Exact Solution Approach for the time-dependent traveling salesman problem. Naval Research Logistics\u00a043, 797\u2013820 (1996)","journal-title":"Naval Research Logistics"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1287\/opre.41.6.1055","volume":"41","author":"M. Fischetti","year":"1993","unstructured":"Fischetti, M., Laporte, G., Martello, S.: The Delivery Man Problem and Cumulative Matroids. Operations Research\u00a041, 1055\u20131064 (1993)","journal-title":"Operations Research"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1002\/net.3230200605","volume":"20","author":"A. Lucena","year":"1990","unstructured":"Lucena, A.: Time-Dependent Traveling Salesman Problem - The Deliveryman Case. Networks\u00a020, 753\u2013763 (1990)","journal-title":"Networks"},{"key":"18_CR18","first-page":"3233","volume":"156","author":"I. M\u00e9ndez-D\u00edaz","year":"2008","unstructured":"M\u00e9ndez-D\u00edaz, I., Zabala, P., Lucena, A.: A New Formulation for the Traveling Deliveryman Problem. Discrete Applied Mathematics\u00a0156, 3233\u20133237 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"18_CR19","doi-asserted-by":"crossref","first-page":"36701","DOI":"10.1103\/PhysRevE.64.036701","volume":"64","author":"J. Bentner","year":"2001","unstructured":"Bentner, J., Bauer, G., Obermair, G.M., Morgensten, I., Schneider, J.: Optimization of the time-dependent traveling salesman problem with Monte Carlo methods. Physical Review\u00a0E 64, 36701-1\u201336701-8 (2001)","journal-title":"Physical Review E"},{"key":"18_CR20","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton Univerisity Press, Princeton (1962)"},{"key":"18_CR21","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.2140\/pjm.1957.7.1073","volume":"7","author":"D. Gale","year":"1957","unstructured":"Gale, D.: A theorem of flows in networks. Pacific Journal of Mathematics\u00a07, 1073\u20131082 (1957)","journal-title":"Pacific Journal of Mathematics"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Hoffman, A.: Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. In: Proceedings of Symposium in Applied Mathematics, vol.\u00a010, pp. 113\u2013128 (1960)","DOI":"10.1090\/psapm\/010\/0114759"},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"Hall, P.: On representatives of subsets. Journal of London Mathematical Society\u00a010, 26\u201330 (1935)","journal-title":"Journal of London Mathematical Society"},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1287\/opre.2.4.393","volume":"2","author":"G.B. Dantzig","year":"1954","unstructured":"Dantzig, G.B., Fulkerson, D.R., Johnson, S.M.: Solution of a large-scale Traveling Salesman Problem. Operations Research\u00a02, 393\u2013410 (1954)","journal-title":"Operations Research"},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF01582117","volume":"16","author":"M. Grotschel","year":"1979","unstructured":"Grotschel, M., Padberg, M.: On the Symmetric Traveling Salesman Problem II: Lifing Theorems and Facets. Mathematical Programming\u00a016, 281\u2013302 (1979)","journal-title":"Mathematical Programming"},{"key":"18_CR26","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M. Padberg","year":"1973","unstructured":"Padberg, M.: On the facial structure of set packing polyhedra. Mathematical Programming\u00a05, 199\u2013215 (1973)","journal-title":"Mathematical Programming"},{"key":"18_CR27","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/ijoc.1040.0117","volume":"18","author":"S. Irnich","year":"2006","unstructured":"Irnich, S., Villeneuve, D.: The shortest path problem with resource constraints and k-cycle elimination for k\u2009\u2265\u20093. INFORMS Journal on Computing\u00a018, 391\u2013406 (2006)","journal-title":"INFORMS Journal on Computing"},{"key":"18_CR28","first-page":"645","volume":"3","author":"D. Applegate","year":"1998","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: On The Solution Of Traveling Salesman Problems. Documenta Mathematica\u00a0(Extra vol.\u00a0ICM 3), 645\u2013646 (1998)","journal-title":"Documenta Mathematica"},{"key":"18_CR29","unstructured":"Niskanen, S., Ostergard, P.R.J.: Cliquer user\u2019s guide. Helsinki University of Technology, Communications Laboratory, Technical report 48 (2003)"},{"key":"18_CR30","unstructured":"Ralphs, T.K., Lad\u00e1nyi, L.: COIN\/BCP User\u2019s Manual (2001), http:\/\/www.coin-or.org\/Presentations\/bcp-man.pdf"},{"issue":"4","key":"18_CR31","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB - A traveling salesman problem library. ORSA Journal on Computing\u00a03(4), 376\u2013384 (1991)","journal-title":"ORSA Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13193-6_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:02:33Z","timestamp":1606168953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}