Journal of Combinatorial Optimization

, Volume 36, Issue 1, pp 90–107 | Cite as

Optimum turn-restricted paths, nested compatibility, and optimum convex polygons

  • Maurice Queyranne
  • Laurence A.  Wolsey


We consider two apparently unrelated classes of combinatorial and geometric optimization problems. First, we give compact extended formulations, i.e., polynomial-size linear programming formulations with integer optima, for optimum path problems with turn restrictions satisfying a nested compatibility condition in acyclic digraphs. We then apply these results to optimum convex polygon problems in the plane, by interpreting certain dynamic programming algorithms as sequences of optimum turn-restricted path problems with nested compatibility in acyclic digraphs. As a result, we derive compact extended formulations for these geometric problems as well.


Shortest paths Turn restrictions Convex polygons Convex subsets Extended formulation Dynamic programming 



This work was completed while the first author was serving as Research Director of CORE, the Center for Operations Research and Econometrics, Université catholique de Louvain, whose hospitality is gratefully acknowledged. The authors would like to thank the following colleagues for useful discussions and suggestions on optimum convex polygon and convex subset problems—in approximate chronological order: Marcos Goycoolea (Universidad Adolfo Ibañez), Jeremy Barbay (Universidad de Chile), Miguel Constantino (Universidade de Lisboa), Marek Chrobak (University of California, Riverside), Keno Merckx and Jean-Paul Doignon (Université Libre de Bruxelles).


  1. 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–44Google Scholar
  2. Bast H, Delling D, Goldberg A, Müller-Hannemann M, Pajor T, Sanders P, Wagner D, Werneck RF (2015) Route planning in transportation networks. arXiv:1504.05140
  3. Bautista-Santiago C, Díaz-Báñez JM, Lara D, Pérez-Lantero P, Urrutia J, Ventura I (2011) Computing optimal islands. Oper Res Lett 39(4):246–251MathSciNetCrossRefzbMATHGoogle Scholar
  4. Borgwardt S, Brieden A, Gritzmann P (2014) Geometric clustering for the consolidation of farmland and woodland. Math Intell 36(2):37–44MathSciNetCrossRefzbMATHGoogle Scholar
  5. Bucarey V, Ordóñez F, Bassaletti E (2015) Shape and balance in police districting. In: Applications of location analysis. Springer, Berlin, pp 329–347Google Scholar
  6. Caldwell T (1961) On finding minimum routes in a network with turn penalties. Commun ACM 4(2):107–108MathSciNetCrossRefzbMATHGoogle Scholar
  7. Conforti M, Cornuéjols G, Zambelli G (2010) Extended formulations in combinatorial optimization. 4OR 8(1):1–48MathSciNetCrossRefzbMATHGoogle Scholar
  8. Delling D, Goldberg AV, Pajor T, Werneck RF (2011) Customizable route planning. In: Experimental algorithms. Springer, Berlin, pp 376–387Google Scholar
  9. Doignon JP, Ducamp A, Falmagne JC (1984) On realizable biorders and the biorder dimension of a relation. J Math Psychol 28(1):73–109MathSciNetCrossRefzbMATHGoogle Scholar
  10. Eppstein D, Overmars M, Rote G, Woeginger G (1992) Finding minimum areak-gons. Discrete Comput Geom 7(1):45–58MathSciNetCrossRefzbMATHGoogle Scholar
  11. Geisberger R, Vetter C (2011) Efficient routing in road networks with turn costs. In: Experimental algorithms. Springer, Berlin, pp 100–111Google Scholar
  12. Gutiérrez 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–182MathSciNetCrossRefzbMATHGoogle Scholar
  13. 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–25MathSciNetzbMATHGoogle Scholar
  14. Korte B, Lovász L (1989) Polyhedral results for antimatroids. Ann N Y Acad Sci 555(1):283–295MathSciNetCrossRefzbMATHGoogle Scholar
  15. Korte B, Lovász L, Schrader R (1991) Greedoids, vol 4. Springer, BerlinzbMATHGoogle Scholar
  16. Llorente IDP, Hoganson HM, Carson MT, Windmuller-Campione M (2017) Recognizing spatial considerations in forest management planning. Curr For Rep 3(4):308–316Google Scholar
  17. Vanegas P, Cattrysse D, Van Orshoven J (2010) Compactness in spatial decision support: a literature review. Comput Sci Appl ICCSA 2010:414–429Google Scholar
  18. Wilfong GT (1990) Motion planning for an autonomous vehicle. In: Autonomous robot vehicles. Springer, Berlin, pp 391–395Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.UBC Sauder School of BusinessUniversity of British ColumbiaVancouverCanada
  2. 2.Center for Operations Research and Econometrics (CORE)Université catholique de LouvainLouvain-la-NeuveBelgium

Personalised recommendations