相关论文: On a Cardinality-Constrained Transportation Proble…

We study the entropic regularizations of optimal transport problems under suitable summability assumptions on the point-wise transport cost. These summability assumptions already appear in the literature. However, we show that the weakest…

We present a range of applications of localisation for constrained transports for pairs of probability measures in order with respect to a lattice cone. These examples comprise irreducible convex paving for martingale transports in…

In order to keep a green planet, in particular its important to limiting the pollution with gas emissions. In a specific capacitated fixed-charge transportation problem with fixed capacities for distribution centers and customers with…

This paper connects discrete optimal transport to a certain class of multi-objective optimization problems. In both settings, the decision variables can be organized into a matrix. In the multi-objective problem, the notion of Pareto…

In the Triangle-Free (Simple) 2-Matching problem we are given an undirected graph $G=(V,E)$. Our goal is to compute a maximum-cardinality $M\subseteq E$ satisfying the following properties: (1) at most two edges of $M$ are incident on each…

This article generalizes the study of branched/ramified optimal transportation to those with capacity constraints. Each admissible transport network studied here is represented by a transport multi-path between measures, with a capacity…

This article is devoted to propose some lower and upper bounds for the coupled-tasks scheduling problem in presence of compatibility constraints according to classical complexity hypothesis ($\mathcal{P} \neq \mathcal{NP}$,…

This paper studies the geometry of the optimizer for the optimal transport problem with capacity constraints. We introduce the concept of c-capacity monotonicity, which is a generalization of c-cyclical monotonicity in optimal transport. We…

In this paper, we address the existence and computation of competitive equilibrium in the transportation market for autonomous carpooling first proposed by [Ostrovsky and Schwarz, 2019]. At equilibrium, the market organizes carpooled trips…

We consider the optimal transport problem over convex costs arising from optimal control of linear time-invariant(LTI) systems when the initial and target measures are assumed to be supported on the set of equilibrium points of the LTI…

We consider the problem of deciding the satisfiability of quantifier-free formulas in the theory of finite sets with cardinality constraints. Sets are a common high-level data structure used in programming; thus, such a theory is useful for…

The minimum constraint removal problem seeks to find the minimum number of constraints, i.e., obstacles, that need to be removed to connect a start to a goal location with a collision-free path. This problem is NP-hard and has been studied…

The mixing set with a knapsack constraint arises as a substructure in mixed-integer programming reformulations of chance-constrained programs with stochastic right-hand-sides over a finite discrete distribution. Recently, Luedtke et al.…

We consider the Chance Constrained Model Predictive Control problem for polynomial systems subject to disturbances. In this problem, we aim at finding optimal control input for given disturbed dynamical system to minimize a given cost…

We consider the Dirichlet problem for the Beltrami equation in some simply connected domain. We consider the class of all homeomorphic solutions of such a problem with a normalization condition and set-theoretic constraints on their complex…

This paper considers a recoverable robust single-machine scheduling problem under polyhedral uncertainty with the objective of minimising the total flow time. In this setting, a decision-maker must determine a first-stage schedule subject…

Finding paths in graphs is a fundamental graph-theoretic task. In this work, we we are concerned with finding a path with some constraints on its length and the number of vertices neighboring the path, that is, being outside of and incident…

We investigate weighted settings of popular matching problems with matroid constraints. The concept of popularity was originally defined for matchings in bipartite graphs, where vertices have preferences over the incident edges. There are…

We prove new necessary and sufficient conditions to carry out a compact linearization approach for a general class of binary quadratic problems subject to assignment constraints as it has been proposed by Liberti in 2007. The new conditions…

We examine the problem of projecting subsets of a commutative, positively ordered monoid into an $o$-ideal. We prove that to this end one may restrict to a sufficient subset, for whose cardinality we provide an explicit upper bound. Several…