{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T15:59:00Z","timestamp":1774367940281,"version":"3.50.1"},"reference-count":30,"publisher":"Informa UK Limited","issue":"13","funder":[{"DOI":"10.13039\/501100004569","name":"Ministry of Science and Higher Education of Poland","doi-asserted-by":"publisher","award":["S\/WZ\/1\/2014"],"award-info":[{"award-number":["S\/WZ\/1\/2014"]}],"id":[{"id":"10.13039\/501100004569","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Production Research"],"published-print":{"date-parts":[[2020,7,2]]},"DOI":"10.1080\/00207543.2019.1637036","type":"journal-article","created":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T14:44:37Z","timestamp":1562683477000},"page":"3965-3975","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":11,"title":["Non-approximability of the single crane container transhipment problem"],"prefix":"10.1080","volume":"58","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0182-870X","authenticated-orcid":false,"given":"Erwin","family":"Pesch","sequence":"first","affiliation":[{"name":"Faculty III \u2013 Management Information Science, University of Siegen, Siegen, Germany"},{"name":"Center for Advanced Studies in Management, HHL Leipzig Graduate School of Management, Leipzig, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6897-0375","authenticated-orcid":false,"given":"Katarzyna Anna","family":"Kuzmicz","sequence":"additional","affiliation":[{"name":"Faculty of Engineering Management, Bialystok University of Technology, Bialystok, Poland"}]}],"member":"301","published-online":{"date-parts":[[2019,7,9]]},"reference":[{"key":"CIT0001","unstructured":"Aggarwal, N., N. Garg, and S. Gupta. 2011. \u201cA 43-Approximation for TSP on Cubic 3-Edge-Connected Graphs.\u201d ArXiv:1101.5586."},{"key":"CIT0002","unstructured":"Arora, S. 1996. \u201cPolynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems.\u201d Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 2\u201311. IEEE."},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2017.1603"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2015.1113327"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.01.008"},{"key":"CIT0006","unstructured":"Boyd, S., R. Sitters, S. van der Ster, and L. Stougie. 2011. \u201cTSP on Cubic and Subcubic Graphs.\u201d IPCO, 65\u201377."},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1120.0415"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.04.008"},{"key":"CIT0009","unstructured":"Christofides, N. 1976. \u201cWorst-case Analysis of a New Heuristic for the Traveling Salesman Problem.\u201d Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh."},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120103"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2004.09.005"},{"key":"CIT0012","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.06.028"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1515\/emj-2017-0023"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2018.06.004"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.07.021"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1145\/2739008"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-012-9439-7"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2017.0811"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1002\/net.21818"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2016.0688"},{"key":"CIT0022","unstructured":"Oveis Gharan, S., A. Saberi, and M. Singh. 2011. \u201cA Randomized Rounding Approach to the Traveling Salesman Problem.\u201d Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 550\u2013559."},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-006-0008-z"},{"key":"CIT0024","doi-asserted-by":"crossref","unstructured":"Seb\u00f5, A. 2013. \u201cEight-fifth Approximation for the Path TSP.\u201d In M. Goemans and J. Correa (eds.) Integer Programming and Combinatorial Optimization, 362\u2013374. Berlin, Heidelberg: Springer.","DOI":"10.1007\/978-3-642-36694-9_31"},{"key":"CIT0025","unstructured":"Seb\u00f5, A., and J. Vygen. 2012. \u201cShorter Tours by Nicer Ears.\u201d ArXiv:1201.1870."},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-007-0100-9"},{"key":"CIT0027","doi-asserted-by":"crossref","unstructured":"Svensson, O., J. Tarnawski, and L. A. Vegh. 2017. \u201cA Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem.\u201d ArXiv:1708.04215.","DOI":"10.1145\/3188745.3188824"},{"key":"CIT0028","unstructured":"Vishnoi, N. K. 2012. \u201cA Permanent Approach to the Traveling Salesman Problem.\u201d 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS), 76\u201380."},{"key":"CIT0029","unstructured":"Vygen, J. 2012. \u201cNew Approximation Algorithms for the TSP.\u201d Forschungsinstitut f\u00fcr Diskrete Mathematik, Rheinische Friedrich-Wilhelms-Universit\u00e4t Bonn. http:\/\/www.or.uni-bonn.de\/home\/vygen\/files\/optima.pdf."},{"key":"CIT0030","unstructured":"Zenklusen, R. 2018. \u201cA 12-approximation for Path TSP.\u201d ArXiv:1805.04131."}],"container-title":["International Journal of Production Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207543.2019.1637036","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,22]],"date-time":"2021-03-22T15:12:26Z","timestamp":1616425946000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00207543.2019.1637036"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,9]]},"references-count":30,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2020,7,2]]}},"alternative-id":["10.1080\/00207543.2019.1637036"],"URL":"https:\/\/doi.org\/10.1080\/00207543.2019.1637036","relation":{},"ISSN":["0020-7543","1366-588X"],"issn-type":[{"value":"0020-7543","type":"print"},{"value":"1366-588X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,9]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tprs20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tprs20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2018-12-26","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-06-19","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-07-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}