{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T20:16:24Z","timestamp":1771704984400,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,5,30]],"date-time":"2010-05-30T00:00:00Z","timestamp":1275177600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1007\/s11590-010-0205-y","type":"journal-article","created":{"date-parts":[[2010,5,29]],"date-time":"2010-05-29T07:01:15Z","timestamp":1275116475000},"page":"259-272","source":"Crossref","is-referenced-by-count":14,"title":["New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem"],"prefix":"10.1007","volume":"5","author":[{"given":"Subhash C.","family":"Sarin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liming","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,30]]},"reference":[{"key":"205_CR1","unstructured":"Baker, T., Muckstadt, J.A.: The CHES problems. Technical Paper, Chesapeake Decision Sciences, Inc., Providence (1989)"},{"key":"205_CR2","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1287\/mnsc.47.7.993.9800","volume":"47","author":"G. Belvaux","year":"2001","unstructured":"Belvaux G., Wolsey L.A.: Modeling practical lot-sizing problems as mixed integer programs. Manage. Sci. 47, 993\u20131007 (2001)","journal-title":"Manage. Sci."},{"key":"205_CR3","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/0213007","volume":"13","author":"S.S. Cosmadakis","year":"1984","unstructured":"Cosmadakis S.S., Papadimitriou C.H.: The traveling salesman problem with many visits to few cities. SIAM J. Comput. 13, 99\u2013108 (1984)","journal-title":"SIAM J. Comput."},{"key":"205_CR4","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1287\/opre.2.4.393","volume":"2","author":"G. Dantzig","year":"1954","unstructured":"Dantzig G., Fulkerson D., Johnson S.: Solution of a large scale traveling salesman problem. Oper. Res. 2, 393\u2013410 (1954)","journal-title":"Oper. Res."},{"key":"205_CR5","doi-asserted-by":"crossref","first-page":"2987","DOI":"10.1016\/j.cor.2004.04.012","volume":"32","author":"S.G. Dastidar","year":"2005","unstructured":"Dastidar S.G., Nagi R.: Scheduling injection modeling operations with multiple resource constraints and sequence dependent setup times and costs. Comput. Oper. Res. 32, 2987\u20133005 (2005)","journal-title":"Comput. Oper. Res."},{"key":"205_CR6","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/0377-2217(94)90083-3","volume":"75","author":"B. Fleischmann","year":"1994","unstructured":"Fleischmann B.: The discrete lot-sizing and scheduling problem with sequence-dependent setup costs. Eur. J. Oper. Res. 75, 395\u2013404 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"205_CR7","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.disopt.2005.11.002","volume":"3","author":"A. Grigoriev","year":"2006","unstructured":"Grigoriev A., van de Klundert J.: On the high multiplicity traveling salesman problem. Discrete Optim. 3, 50\u201362 (2006)","journal-title":"Discrete Optim."},{"key":"205_CR8","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1016\/j.cor.2003.08.014","volume":"32","author":"D. Gupta","year":"2005","unstructured":"Gupta D., Magnusson T.: The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times. Comput. Oper. Res. 32, 727\u2013747 (2005)","journal-title":"Comput. Oper. Res."},{"key":"205_CR9","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0925-5273(99)00119-X","volume":"66","author":"K. Hasse","year":"2000","unstructured":"Hasse K., Kimms A.: Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities. Int. J. Prod. Econ. 66, 159\u2013169 (2000)","journal-title":"Int. J. Prod. Econ."},{"key":"205_CR10","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/mnsc.45.2.273","volume":"45","author":"S. Kang","year":"1999","unstructured":"Kang S., Malik K., Thomas L.J.: Lotsizing and scheduling on parallel machines with sequence-dependent setup costs. Manage. Sci. 45, 273\u2013289 (1999)","journal-title":"Manage. Sci."},{"key":"205_CR11","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0377-2217(01)00373-3","volume":"139","author":"H. Meyr","year":"2002","unstructured":"Meyr H.: Simultaneous lotsizing and scheduling on parallel machines. Eur. J. Oper. Res. 139, 277\u2013292 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"205_CR12","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.orl.2004.03.007","volume":"33","author":"S.C. Sarin","year":"2005","unstructured":"Sarin S.C., Sherali H.D., Bhootra A.: New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints. Oper. Res. Lett. 33, 62\u201370 (2005)","journal-title":"Oper. Res. Lett."},{"key":"205_CR13","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.disopt.2005.10.004","volume":"3","author":"H.D. Sherali","year":"2006","unstructured":"Sherali H.D., Sarin S.C., Tsai P.F.: A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints. Discrete Optim. 3, 20\u201332 (2006)","journal-title":"Discrete Optim."},{"key":"205_CR14","unstructured":"Wong, R.T.: Integer programming formulations of the traveling salesman problem. In: Proceedings of the IEEE International Conference on Circuits and Computers, Part I, pp. 149\u2013152, New York (1980)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0205-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-010-0205-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0205-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T15:15:04Z","timestamp":1559574904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-010-0205-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,30]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["205"],"URL":"https:\/\/doi.org\/10.1007\/s11590-010-0205-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,30]]}}}