相关论文: Inverse Fractional Knapsack Problem with Profits a…
We consider a general class of binary packing problems with a convex quadratic knapsack constraint. We prove that these problems are APX-hard to approximate and present constant-factor approximation algorithms based upon three different…
Fractional Dzherbashian-Nersesian operator is considered and three famous fractional order derivatives namely Riemann-Liouville, Caputo and Hilfer derivatives are shown to be special cases of the earlier one. The expression for Laplace…
Quadratic invariance is a condition which has been shown to allow for optimal decentralized control problems to be cast as convex optimization problems. The condition relates the constraints that the decentralization imposes on the…
In this paper, we study the stochastic unbounded min-knapsack problem ($\textbf{Min-SUKP}$). The ordinary unbounded min-knapsack problem states that: There are $n$ types of items, and there is an infinite number of items of each type. The…
We introduce in this document a direct method allowing to solve numerically inverse type problems for linear parabolic equations. We consider the reconstruction of the full solution of the parabolic equation posed in $\Omega\times (0,T)$ -…
This thesis presents new mathematical algorithms for the numerical solution of a mathematical problem class called \emph{dynamic optimization problems}. These are mathematical optimization problems, i.e., problems in which numbers are…
Reinforcement learning addresses the dilemma between exploration to find profitable actions and exploitation to act according to the best observations already made. Bandit problems are one such class of problems in stateless environments…
This paper is concerned with a stochastic linear-quadratic optimal control problem in a finite time horizon, where the coefficients of the control system are allowed to be random, and the weighting matrices in the cost functional are…
Stochastic knapsack problem originally was a versatile model for controls in telecommunication networks. Recently, it draws attentions of revenue management community by serving as a basic model for allocating resources over time. We…
This paper studies distributed continuous-time optimization for time-varying quadratic cost functions with uncertain parameters. We first propose a centralized adaptive optimization algorithm using partial information of the cost function.…
This paper is concerned with a backward stochastic linear-quadratic (LQ, for short) optimal control problem with deterministic coefficients. The weighting matrices are allowed to be indefinite, and cross-product terms in the control and…
The stochastic knapsack has been used as a model in wide ranging applications from dynamic resource allocation to admission control in telecommunication. In recent years, a variation of the model has become a basic tool in studying problems…
We consider the distributed version of the Multiple Knapsack Problem (MKP), where $m$ items are to be distributed amongst $n$ processors, each with a knapsack. We propose different distributed approximation algorithms with a tradeoff…
We study the problem of maximizing a monotone submodular function subject to a Multiple Knapsack constraint. The input is a set $I$ of items, each has a non-negative weight, and a set of bins of arbitrary capacities. Also, we are given a…
An unconstrained nonlinear binary optimization problem of selecting a maximum expected value subset of items is considered. Each item is associated with a profit and probability. Each of the items succeeds or fails independently with the…
In this work, we attempt to solve the integer-weight knapsack problem using the D-Wave 2000Q adiabatic quantum computer. The knapsack problem is a well-known NP-complete problem in computer science, with applications in economics, business,…
In this paper we consider a sub-diffusion problem where the fractional time derivative is approximated either by the L1 scheme or by Convolution Quadrature. We propose new interpretations of the numerical schemes which lead to a posteriori…
When considering fractional diffusion equation as model equation in analyzing anomalous diffusion processes, some important parameters in the model related to orders of the fractional derivatives, are often unknown and difficult to be…
We study the distributed Linear Quadratic Gaussian (LQG) control problem in discrete-time and finite-horizon, where the controller depends linearly on the history of the outputs and it is required to lie in a given subspace, e.g. to possess…
Optimal regret bounds for Multi-Armed Bandit problems are now well documented. They can be classified into two categories based on the growth rate with respect to the time horizon $T$: (i) small, distribution-dependent, bounds of order of…