相关论文: On a Cardinality-Constrained Transportation Proble…
This paper introduces the Packing While Traveling problem as a new non-linear knapsack problem. Given are a set of cities that have a set of items of distinct profits and weights and a vehicle that may collect the items when visiting all…
Unlike ordinal-utility matching markets, which are well-developed from the viewpoint of both theory and practice, recent insights from a computer science perspective have left cardinal-utility matching markets in a state of flux. The…
We study the polyhedral convex hull structure of a mixed-integer set which arises in a class of cardinality-constrained concave submodular minimization problems. This class of problems has an objective function in the form of $f(a^\top x)$,…
This article presents examples of an application of the finite field method for the computation of the characteristic polynomial of the matching arrangement of a graph. Weight functions on edges of a graph with weights from a finite field…
This paper studies the problem of, given the structure of a linear-time invariant system and a set of possible inputs, finding the smallest subset of input vectors that ensures system's structural controllability. We refer to this problem…
Two probability distributions $\mu$ and $\nu$ in second stochastic order can be coupled by a supermartingale, and in fact by many. Is there a canonical choice? We construct and investigate two couplings which arise as optimizers for…
Index tracking is a popular passive investment strategy aimed at optimizing portfolios, but fully replicating an index can lead to high transaction costs. To address this, partial replication have been proposed. However, the cardinality…
We shall present a measure theoretical approach for which together with the Kantorovich duality provide an efficient tool to study the optimal transport problem. Specifically, we study the support of optimal plans where the cost function…
We show that any submodular minimization (SM) problem defined on a linear constraint set with constraints having up to two variables per inequality, are 2-approximable in polynomial time. If the constraints are monotone (the two variables…
This paper presents a systematic approach for analyzing the departure-time choice equilibrium (DTCE) problem of a single bottleneck with heterogeneous commuters. The approach is based on the fact that the DTCE is equivalently represented as…
Several variants of the Constraint Satisfaction Problem have been proposed and investigated in the literature for modelling those scenarios where solutions are associated with some given costs. Within these frameworks computing an optimal…
In this work we consider the problem of finding the minimum-weight loop cover of an undirected graph. This combinatorial optimization problem is called 2-matching and can be seen as a relaxation of the traveling salesman problem since one…
We consider mixed-integer optimal control problems with combinatorial constraints that couple over time such as minimum dwell times. We analyze a lifting and decomposition approach into a mixed-integer optimal control problem without…
Model Predictive Control (MPC) is often tuned by trial and error. When a baseline linear controller exists that is already well tuned in the absence of constraints and MPC is introduced to enforce them, one would like to avoid altering 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…
In this paper, we solve the time inconsistent portfolio selection problem by using different utility functions with a moving target as our constraint. We solve this problem by finding an equilibrium control under the given definition as our…
Paper provides a method for solving the reverse Monge-Kantorovich transport problem (TP). It allows to accumulate positive decision-taking experience made by decision-taker in situations that can be presented in the form of TP. The initial…
Mathematical modeling is a standard approach to solve many real-world problems and {\em diversity} of solutions is an important issue, emerging in applying solutions obtained from mathematical models to real-world problems. Many studies…
In 2005, Goddard, Hedetniemi, Hedetniemi and Laskar [Generalized subgraph-restricted matchings in graphs, Discrete Mathematics, 293 (2005) 129 - 138] asked the computational complexity of determining the maximum cardinality of a matching…
We study optimal mass transport problems between two measures with respect to a non-traditional cost function, i.e. a cost $c$ which can attain the value $+\infty$. We define the notion of $c$-compatibility and strong-$c$-compatibility of…