A distance function for computing on finite subsets of Euclidean spaces
DOI10.1007/s10255-018-0735-0zbMath1445.53034OpenAlexW2791694351MaRDI QIDQ1709440
Hajar Ghahremani-Gol, Asadollah Razavi, Farzad Didehvar
Publication date: 5 April 2018
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-018-0735-0
geodesicleast square methodtraveling salesman problemvehicle routing problemthree-dimensional triangulation
Approximation methods and heuristics in mathematical programming (90C59) Geodesics in global differential geometry (53C22) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing PDE-based surfaces bounded by geodesics or lines of curvature
- On the number of higher order Delaunay triangulations
- Parametric representation of a surface pencil with a common spatial geodesic
- A novel two-phase heuristic method for vehicle routing problem with backhauls
- Higher-order Voronoi diagrams on triangulated surfaces
- Energy efficient ant colony algorithms for data aggregation in wireless sensor networks
- The complexity of geodesic Voronoi diagrams on triangulated 2-manifold surfaces
- A review of dynamic vehicle routing problems
- New mathematical models of the generalized vehicle routing problem and extensions
- Voronoi diagram with visual restriction
- The Voronoi diagram of curved objects
- Vehicle routing problems with alternative paths: an application to on-demand transportation
- The Truck Dispatching Problem
- A New Algorithm To Solve Vehicle Routing Problems (VRPs)
- Geometry from a Differentiable Viewpoint
- Vehicle routing problems with split deliveries
- The Traveling-Salesman Problem
This page was built for publication: A distance function for computing on finite subsets of Euclidean spaces
