{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:37:36Z","timestamp":1766579856147,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,4,5]],"date-time":"2018-04-05T00:00:00Z","timestamp":1522886400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s10878-018-0281-y","type":"journal-article","created":{"date-parts":[[2018,4,5]],"date-time":"2018-04-05T14:53:40Z","timestamp":1522940020000},"page":"90-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimum turn-restricted paths, nested compatibility, and optimum convex polygons"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7043-788X","authenticated-orcid":false,"given":"Maurice","family":"Queyranne","sequence":"first","affiliation":[]},{"given":"Laurence A.","family":"Wolsey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,5]]},"reference":[{"key":"281_CR1","doi-asserted-by":"crossref","unstructured":"Balas E (1998) Disjunctive programming: properties of the convex hull of feasible points. GSIA Management Science Research Report MSRR 348, Carnegie Mellon University (1974), published as invited paper. Discrete Appl Math 89(1):3\u201344","DOI":"10.1016\/S0166-218X(98)00136-X"},{"key":"281_CR2","unstructured":"Bast H, Delling D, Goldberg A, M\u00fcller-Hannemann M, Pajor T, Sanders P, Wagner D, Werneck RF (2015) Route planning in transportation networks. arXiv:1504.05140"},{"issue":"4","key":"281_CR3","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.orl.2011.04.008","volume":"39","author":"C Bautista-Santiago","year":"2011","unstructured":"Bautista-Santiago C, D\u00edaz-B\u00e1\u00f1ez JM, Lara D, P\u00e9rez-Lantero P, Urrutia J, Ventura I (2011) Computing optimal islands. Oper Res Lett 39(4):246\u2013251","journal-title":"Oper Res Lett"},{"issue":"2","key":"281_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00283-014-9448-2","volume":"36","author":"S Borgwardt","year":"2014","unstructured":"Borgwardt S, Brieden A, Gritzmann P (2014) Geometric clustering for the consolidation of farmland and woodland. Math Intell 36(2):37\u201344","journal-title":"Math Intell"},{"key":"281_CR5","doi-asserted-by":"crossref","unstructured":"Bucarey V, Ord\u00f3\u00f1ez F, Bassaletti E (2015) Shape and balance in police districting. In: Applications of location analysis. Springer, Berlin, pp 329\u2013347","DOI":"10.1007\/978-3-319-20282-2_14"},{"issue":"2","key":"281_CR6","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/366105.366184","volume":"4","author":"T Caldwell","year":"1961","unstructured":"Caldwell T (1961) On finding minimum routes in a network with turn penalties. Commun ACM 4(2):107\u2013108","journal-title":"Commun ACM"},{"issue":"1","key":"281_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10288-010-0122-z","volume":"8","author":"M Conforti","year":"2010","unstructured":"Conforti M, Cornu\u00e9jols G, Zambelli G (2010) Extended formulations in combinatorial optimization. 4OR 8(1):1\u201348","journal-title":"4OR"},{"key":"281_CR8","doi-asserted-by":"crossref","unstructured":"Delling D, Goldberg AV, Pajor T, Werneck RF (2011) Customizable route planning. In: Experimental algorithms. Springer, Berlin, pp 376\u2013387","DOI":"10.1007\/978-3-642-20662-7_32"},{"issue":"1","key":"281_CR9","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0022-2496(84)90020-8","volume":"28","author":"JP Doignon","year":"1984","unstructured":"Doignon JP, Ducamp A, Falmagne JC (1984) On realizable biorders and the biorder dimension of a relation. J Math Psychol 28(1):73\u2013109","journal-title":"J Math Psychol"},{"issue":"1","key":"281_CR10","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF02187823","volume":"7","author":"D Eppstein","year":"1992","unstructured":"Eppstein D, Overmars M, Rote G, Woeginger G (1992) Finding minimum areak-gons. Discrete Comput Geom 7(1):45\u201358","journal-title":"Discrete Comput Geom"},{"key":"281_CR11","doi-asserted-by":"crossref","unstructured":"Geisberger R, Vetter C (2011) Efficient routing in road networks with turn costs. In: Experimental algorithms. Springer, Berlin, pp 100\u2013111","DOI":"10.1007\/978-3-642-20662-7_9"},{"issue":"1","key":"281_CR12","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10479-007-0198-9","volume":"157","author":"E Guti\u00e9rrez","year":"2008","unstructured":"Guti\u00e9rrez E, Medaglia AL (2008) Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks. Ann Oper Res 157(1):169\u2013182","journal-title":"Ann Oper Res"},{"key":"281_CR13","first-page":"1","volume":"69","author":"D King","year":"2017","unstructured":"King D, Jacobson S, Sewell E (2017) The geo-graph in practice: creating united states congressional districts from census blocks. Comput Optim Appl 69:1\u201325","journal-title":"Comput Optim Appl"},{"issue":"1","key":"281_CR14","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1111\/j.1749-6632.1989.tb22462.x","volume":"555","author":"B Korte","year":"1989","unstructured":"Korte B, Lov\u00e1sz L (1989) Polyhedral results for antimatroids. Ann N Y Acad Sci 555(1):283\u2013295","journal-title":"Ann N Y Acad Sci"},{"key":"281_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58191-5","volume-title":"Greedoids","author":"B Korte","year":"1991","unstructured":"Korte B, Lov\u00e1sz L, Schrader R (1991) Greedoids, vol 4. Springer, Berlin"},{"issue":"4","key":"281_CR16","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/s40725-017-0068-x","volume":"3","author":"IDP Llorente","year":"2017","unstructured":"Llorente IDP, Hoganson HM, Carson MT, Windmuller-Campione M (2017) Recognizing spatial considerations in forest management planning. Curr For Rep 3(4):308\u2013316","journal-title":"Curr For Rep"},{"key":"281_CR17","first-page":"414","volume":"2010","author":"P Vanegas","year":"2010","unstructured":"Vanegas P, Cattrysse D, Van Orshoven J (2010) Compactness in spatial decision support: a literature review. Comput Sci Appl ICCSA 2010:414\u2013429","journal-title":"Comput Sci Appl ICCSA"},{"key":"281_CR18","doi-asserted-by":"crossref","unstructured":"Wilfong GT (1990) Motion planning for an autonomous vehicle. In: Autonomous robot vehicles. Springer, Berlin, pp 391\u2013395","DOI":"10.1007\/978-1-4613-8997-2_28"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0281-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0281-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0281-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T23:07:07Z","timestamp":1693609627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0281-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,5]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["281"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0281-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2018,4,5]]},"assertion":[{"value":"5 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}