A distance function for computing on finite subsets of Euclidean spaces
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3511136 (Why is no real title available?)
- scientific article; zbMATH DE number 1077335 (Why is no real title available?)
- A New Algorithm To Solve Vehicle Routing Problems (VRPs)
- A novel two-phase heuristic method for vehicle routing problem with backhauls
- A review of dynamic vehicle routing problems
- Constructing PDE-based surfaces bounded by geodesics or lines of curvature
- Elementary differential geometry
- Energy efficient ant colony algorithms for data aggregation in wireless sensor networks
- Geometry from a Differentiable Viewpoint
- Higher-order Voronoi diagrams on triangulated surfaces
- New mathematical models of the generalized vehicle routing problem and extensions
- On the number of higher order Delaunay triangulations
- Parametric representation of a surface pencil with a common spatial geodesic
- The Voronoi diagram of curved objects
- The complexity of geodesic Voronoi diagrams on triangulated 2-manifold surfaces
- The traveling-salesman problem
- The truck dispatching problem
- Vehicle routing problems with alternative paths: an application to on-demand transportation
- Vehicle routing problems with split deliveries
- Voronoi diagram with visual restriction
Cited in
(3)
This page was built for publication: A distance function for computing on finite subsets of Euclidean spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1709440)