In this paper we analyze a continuous version of the maximal covering location problem, in which facilities are required to be linked by means given graph structure (provided that two allowed if distance is not exceed). We propose mathematical programming framework for problem and different resolution strategies. First, provide Mixed Integer Non Linear Programming formulation derive some geomet...

Abstract In this work we analyze regularized optimal transport problems in the so-called Kantorovich form, i.e. given two Radon measures on compact sets, aim is to find a plan, which another measure product of that has these as marginals and minimizes sum certain linear cost function regularization term. We focus terms where Young’s applied (density the) plan integrated against measure. This fo...

In recent years, the efficient numerical solution of Hamiltonian problems has led to definition a class energy-conserving Runge-Kutta methods named Boundary Value Methods (HBVMs). Such admit an interesting interpretation in terms continuous-stage methods, which is here recalled and revisited for general differential problems.