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

DOI10.1007/s10878-018-0281-yzbMath1402.90157OpenAlexW2464795612MaRDI QIDQ724738

Laurence A. Wolsey, Maurice Queyranne

Publication date: 26 July 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://alfresco-guest.uclouvain.be/alfresco/service/guest/streamDownload/workspace/SpacesStore/97111849-92f8-450f-b1a8-118e3fb8b0fe/coredp2016_20web.pdf?a=true&guest=true

zbMATH Keywords

dynamic programmingconvex subsetsconvex polygonsshortest pathsextended formulationturn restrictions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (1)

A correct response model in knowledge structure theory

Cites Work

• Unnamed Item
• Computing optimal islands
• Geometric clustering for the consolidation of farmland and woodland
• The geo-graph in practice: creating United States congressional districts from census blocks
• Greedoids
• Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks
• On realizable biorders and the biorder dimension of a relation
• Finding minimum area \(k\)-gons
• Disjunctive programming: Properties of the convex hull of feasible points
• On finding minimum routes in a network with turn penalties
• Extended formulations in combinatorial optimization

This page was built for publication: Optimum turn-restricted paths, nested compatibility, and optimum convex polygons