2 papers
math.OC2021
A Gradient Descent Method for The Dubins Traveling Salesman Problem
David Kirszenblat, José Ayala, J. Hyam Rubinstein
We propose a combination of a bounding procedure and gradient descent method for solving the Dubins traveling salesman problem, that is, the problem of finding a shortest curvature…
math.MG2016
Minimal curvature-constrained networks
David Kirszenblat, Kashyapa Sirinanda, Marcus Brazil +3
This paper introduces an exact algorithm for the construction of a shortest curvature-constrained network interconnecting a given set of directed points in the plane and an iterati…