相关论文: On a transport problem and monoids of non-negative…

A numerical set $T$ is a subset of $\mathbb N_0$ that contains $0$ and has finite complement. The atom monoid of $T$ is the set of $x \in \mathbb N_0$ such that $x+T \subseteq T$. Marzuola and Miller introduced the anti-atom problem: how…

We study the routing problem for vehicles with limited energy through a network of inhomogeneous charging nodes. This is substantially more complicated than the homogeneous node case studied in [1]. We seek to minimize the total elapsed…

Motivated by a recent Diophantine transport problem about how to transport profitably a group of persons or objects, we survey classical facts about solving systems of linear Diophantine equations and inequalities in nonnegative integers.…

In the semi-discrete version of Monge's problem one tries to find a transport map $T$ with minimum cost from an absolutely continuous measure $\mu$ on $\mathbb{R}^d$ to a discrete measure $\nu$ that is supported on a finite set in…

Given a polynomial $f(x_1,x_2,\ldots, x_t)$ in $t$ variables with integer coefficients and a positive integer $n$, let $\alpha(n)$ be the number of integers $0\leq a<n$ such that the polynomial congruence $f(x_1, x_2, \ldots, x_t)\equiv a\…

The objective of this article is to formalize the definition of NP problems. We construct a mathematical model of discrete problems as independence systems with weighted elements. We introduce two auxiliary sets that characterize the…

We study a generalization of the multi-marginal optimal transport problem, which has no fixed number of marginals $N$ and is inspired of statistical mechanics. It consists in optimizing a linear combination of the costs for all the possible…

We study a multi-marginal optimal transport problem with surplus $b(x_{1}, \ldots, x_{m})=\sum_{\{i,j\}\in P} x_{i}\cdot x_{j}$, where $P\subseteq Q:=\{\{i,j\}: i, j \in \{1,2,...m\}, i \neq j\}$. We reformulate this problem by associating…

By disintegration of transport plans it is introduced the notion of transport class. This allows to consider the Monge problem as a particular case of the Kantorovich transport problem, once a transport class is fixed. The transport problem…

An integer feasibility problem is a fundamental problem in many areas, such as operations research, number theory, and statistics. To study a family of systems with no nonnegative integer solution, we focus on a commutative semigroup…

We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…

We introduce a framework to consider transport problems for integer-valued random variables. We introduce weighting coefficients which allow us to characterize transport problems in a gradient flow setting, and form the basis of our…

The need to reason about uncertainty in large, complex, and multi-modal datasets has become increasingly common across modern scientific environments. The ability to transform samples from one distribution $P$ to another distribution $Q$…

We consider maps $T$ solving the optimal transport problem with a cost $c(x-y)$ modeled on the $p$-cost. For H\"older continuous marginals, we prove a $C^{1,\alpha}$-partial regularity result for $T $in the set $\{|T(x)-x|>0\}$.

Given facilities with capacities and clients with penalties and demands, the transportation problem with market choice consists in finding the minimum-cost way to partition the clients into unserved clients, paying the penalties, and into…

We link the theory of optimal transportation to the theory of integer partitions. Let $\mathscr P(n)$ denote the set of integer partitions of $n \in \mathbb N$ and write partitions $\pi \in \mathscr P(n)$ as $(n_1, \dots, n_{k(\pi)})$.…

A ride sharing problem is considered where we are given a graph, whose edges are equipped with a travel cost, plus a set of objects, each associated with a transportation request given by a pair of origin and destination nodes. A vehicle…

We prove compactness and hence existence for solutions to a class of non linear transport equations. The corresponding models combine the features of linear transport equations and scalar conservation laws. We introduce a new method which…

Let $R$ and $B$ be two point sets in $\mathbb{R}^d$, with $|R|+ |B| = n$ and where $d$ is a constant. Next, let $\lambda : R \cup B \to \mathbb{N}$ such that $\sum_{r \in R } \lambda(r) = \sum_{b \in B} \lambda(b)$ be demand functions over…

Formal power series come up in several areas such as formal language theory , algebraic and enumerative combinatorics, semigroup theory, number theory etc. This paper focuses on the set x R[[x]] consisting of formal power series with zero…