Convex geometry and combinatorial optimisation form a vibrant nexus of research that bridges theoretical mathematics with practical algorithm design.

Convex geometry is a vibrant area of mathematics that investigates the properties and structure of convex sets in Euclidean spaces. This field is intrinsically linked to a series of fundamental ...

Euclidean distance geometry is the study of Euclidean geometry based on the concept of distance. This is useful in several applications where the input data consist of an incomplete set of distances ...

In this paper, we consider the problem of designing an optimal hub-and-spoke network in continuous Euclidean space: the "spokes" of the network are distributed uniformly over a service region, and our ...