The p-center problem (pCP) is a fundamental problem in location science, where we are
given customer demand points and possible facility locations, and we want to choose p of …

The spatial optimization method between combinatorial optimization problems and GIS has
many geographical applications. The p-center problem is a classic NP-hard location …

This paper presents a novel technology for the in-situ robot elastic calibration (IREC) in
industrial settings. It was especially formulated for robots that are used for accuracy …

The graph burning problem is an NP-hard combinatorial optimization problem that helps
quantify how vulnerable a graph is to contagion. This paper introduces three mathematical …

Graph burning is a process to determine the spreading of information in a graph. If a
sequence of vertices burns all the vertices of a graph by following the graph burning …

Datasets with non-trivial large scale topology can be hard to embed in low-dimensional
Euclidean space with existing dimensionality reduction algorithms. We propose to model …

The capacitated vertex k-center problem receives as input a complete weighted graph and a
set of capacity constraints. Its goal is to find a set of k centers and an assignment of vertices …

This paper presents the spectral gap-based topology control algorithm (SGTC) for wireless
backhaul networks, a novel approach that employs the Laplacian Spectral Gap (LSG) to find …

Given a graph $ G $, the optimization version of the graph burning problem seeks for a
sequence of vertices, $(u_1, u_2,..., u_k)\in V (G)^ k $, with minimum $ k $ and such that …

This research focuses on the k-center problem and its applications. Different methods for
solving this problem are analyzed. The implementations of an exact algorithm and of an …