{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:04:51Z","timestamp":1725487491580},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725879"},{"type":"electronic","value":"9783540725886"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72588-6_49","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T18:35:23Z","timestamp":1184610923000},"page":"293-298","source":"Crossref","is-referenced-by-count":1,"title":["Using Gavish-Grave LP to Formulate the Directed Black and White Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"He","family":"Jiang","sequence":"first","affiliation":[]},{"given":"XianChao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"MingChu","family":"Li","sequence":"additional","affiliation":[]},{"given":"HaoYang","family":"Che","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1109\/24.93762","volume":"40","author":"O.J. Wasem","year":"1991","unstructured":"Wasem, O.J.: An algorithm for designing rings in survivable fiber networks. IEEE Transactions on Reliability\u00a040, 428\u2013432 (1991)","journal-title":"IEEE Transactions on Reliability"},{"issue":"1","key":"49_CR2","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1287\/inte.25.1.20","volume":"25","author":"S. Cosares","year":"1995","unstructured":"Cosares, S., Deutsch, D.N., Saniee, I., Wasem, O.J.: SONET toolkit: a decision support system for designing robust and cost-effective fiber-optic networks. Interfaces\u00a025(1), 20\u201340 (1995)","journal-title":"Interfaces"},{"key":"49_CR3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1287\/trsc.32.1.43","volume":"32","author":"K.T. Talluri","year":"1998","unstructured":"Talluri, K.T.: The four-day aircraft maintenance routing problem. Transportation Science\u00a032, 43\u201353 (1998)","journal-title":"Transportation Science"},{"key":"49_CR4","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1111\/j.1475-3995.2000.tb00209.x","volume":"7","author":"V. Mak","year":"2000","unstructured":"Mak, V., Boland, N.: Heuristic approaches to the asymmetric traveling salesman problem with replenishment arcs. International Transactions in Operation Research\u00a07, 431\u2013447 (2000)","journal-title":"International Transactions in Operation Research"},{"key":"49_CR5","unstructured":"Orman, A.J., Williams, H.P.: A survey of different integer programming formulations of the travelling salesman problem. Working Paper No: LSEOR 04.67, The London School of Economics and Political Science (2004)"},{"key":"49_CR6","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1287\/opre.2.4.393","volume":"2","author":"G.G. Dantzig","year":"1954","unstructured":"Dantzig, G.G., Fulkerson, D.R., Johnson, S.M.: Solutions of a large scale traveling salesman problem. Operations. Research\u00a02, 393\u2013410 (1954)","journal-title":"Operations. Research"},{"key":"49_CR7","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"3","author":"C.E. Miller","year":"1960","unstructured":"Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problem. Journal of ACM\u00a03, 326\u2013329 (1960)","journal-title":"Journal of ACM"},{"key":"49_CR8","unstructured":"Gavish, B., Graves, S.C.: The traveling salesman problem and related problems. Working Paper OR-078-78, Operations Research Center, MIT, Cambridge, MA (1978)"},{"key":"49_CR9","unstructured":"Finke, K.R., Gavish, B., Graves, S.C.: A two-commodity network flow approach to the traveling salesman problem. In: Combinatorics, Graph Theory and Computing, Proc. 14th South Eastern Conf., Atlantic University, Florida (1983)"},{"key":"49_CR10","unstructured":"Wong, R.T.: Integer programming formulations of the traveling salesman problem. In: Proc. IEEE Conf. On Circuits and Computers, pp. 149\u2013152 (1980)"},{"key":"49_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1137\/0605004","volume":"5","author":"A. Claus","year":"1984","unstructured":"Claus, A.: A new formulation for the traveling salesman problem. SIAM Journal of Algorithm and Discrete Mathematics\u00a05, 21\u201325 (1984)","journal-title":"SIAM Journal of Algorithm and Discrete Mathematics"},{"key":"49_CR12","volume-title":"Mathematical Programming","author":"S. Vajda","year":"1961","unstructured":"Vajda, S.: Mathematical Programming. Addison-Wesley, London (1961)"},{"key":"49_CR13","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1287\/opre.28.4.1018","volume":"28","author":"K.R. Fox","year":"1980","unstructured":"Fox, K.R., Gavish, B., Graves, S.C.: An n-constraint formulation of the (time-dependent) traveling salesman problem. Operations Research\u00a028, 1018\u20131021 (1980)","journal-title":"Operations Research"},{"key":"49_CR14","unstructured":"Zhu, Z.: The aircraft rotation problem. PhD thesis, Georgia Institute of Technology (1994)"},{"key":"49_CR15","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/S0377-2217(99)00266-0","volume":"123","author":"N.L. Boland","year":"2000","unstructured":"Boland, N.L., Clarke, L.W., Nemhauser, G.L.: The asymmetric traveling salesman problem with replenishment arcs. European Journal of Operations Research\u00a0123, 408\u2013427 (2000)","journal-title":"European Journal of Operations Research"},{"key":"49_CR16","unstructured":"Vicky, M.: On the asymmetric traveling salesman problem with replenishment arcs. PhD thesis, Department of Mathematics and Statistics, University of Melbourne (2000)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2007"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72588-6_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T02:27:42Z","timestamp":1550456862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72588-6_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540725879","9783540725886"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72588-6_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}