Related papers: Inverse Fractional Knapsack Problem with Profits a…
In this paper, we consider the adaptive linear quadratic Gaussian control problem, where both the linear transformation matrix of the state $A$ and the control gain matrix $B$ are unknown. The proposed adaptive optimal control only assumes…
The online knapsack problem is a classic online resource allocation problem in networking and operations research. Its basic version studies how to pack online arriving items of different sizes and values into a capacity-limited knapsack.…
In this paper, we effectively solve the inverse source problem of the fractional Poisson equation using MC-fPINNs. We construct two neural networks $ u_{NN}(x;\theta )$ and $f_{NN}(x;\psi)$ to approximate the solution $u^{*}(x)$ and the…
In this paper, we consider a class of structured nonsmooth fractional minimization, where the first part of the objective is the ratio of a nonnegative nonsmooth nonconvex function to a nonnegative nonsmooth convex function, while the…
We study the uniform $2$-dimensional vector multiple knapsack (2VMK) problem, a natural variant of multiple knapsack arising in real-world applications such as virtual machine placement. The input for 2VMK is a set of items, each associated…
We study the optimization version of the equal cardinality set partition problem (where the absolute difference between the equal sized partitions' sums are minimized). While this problem is NP-hard and requires exponential complexity to…
The 0-1 knapsack problem is a well-known combinatorial optimisation problem. Approximation algorithms have been designed for solving it and they return provably good solutions within polynomial time. On the other hand, genetic algorithms…
This paper studies the inverse optimal control problem for continuous-time linear quadratic regulators over finite-time horizon, aiming to reconstruct the control, state, and terminal cost matrices in the objective function from observed…
In this paper, we study an inverse problem for identifying the initial value in a space-time fractional diffusion equation from the final time data. We show the identifiability of this inverse problem by proving the existence of its unique…
In this paper, a finite-horizon optimal control problem involving a dynamical system described by a linear Caputo fractional differential equation and a quadratic cost functional is considered. An explicit formula for the value functional…
Online knapsack problem is considered, where items arrive in a sequential fashion that have two attributes; value and weight. Each arriving item has to be accepted or rejected on its arrival irrevocably. The objective is to maximize the sum…
We present improved algorithms for fast calculation of the inverse square root for single-precision floating-point numbers. The algorithms are much more accurate than the famous fast inverse square root algorithm and have the same or…
This work proposes an efficient parallel algorithm for non-monotone submodular maximization under a knapsack constraint problem over the ground set of size $n$. Our algorithm improves the best approximation factor of the existing parallel…
Inverse optimal control problem emerges in different practical applications, where the goal is to design a cost function in order to approximate given optimal strategies of an expert. Typical application is in robotics for generation of…
We study a wholesale supply chain ordering problem. In this problem, the supplier has an initial stock, and faces an unpredictable stream of incoming orders, making real-time decisions on whether to accept or reject each order. What makes…
We study the time-inconsistent linear quadratic optimal control problem for forward-backward stochastic differential equations with potentially indefinite cost weighting matrices for both the state and the control variables. Our research…
We construct an efficient numerical scheme for solving obstacle problems in divergence form. The numerical method is based on a reformulation of the obstacle in terms of an L1-like penalty on the variational problem. The reformulation is an…
We introduce the quadratic balanced optimization problem (QBOP) which can be used to model equitable distribution of resources with pairwise interaction. QBOP is strongly NP-hard even if the family of feasible solutions has a very simple…
This paper is dedicated to addressing the simultaneous inversion problem involving the initial value and space-dependent source term in a time-fractional diffusion-wave equation. Firstly, we establish the uniqueness of the inverse problem…
In [1], the distributed linear-quadratic problem with fixed communication topology (DFT-LQ) and the sparse feedback LQ problem (SF-LQ) are formulated into a nonsmooth and nonconvex optimization problem with affine constraints. Moreover, a…