Zobrazeno 1 - 10
of 302
pro vyhledávání: '"Dey, Santanu S."'
Modern mixed-integer programming solvers use the branch-and-cut framework, where cutting planes are added to improve the tightness of the linear programming (LP) relaxation, with the expectation that the tighter formulation would produce smaller bran
Externí odkaz:
http://arxiv.org/abs/2402.05213
Incorporating energy storage systems (ESS) into power systems has been studied in many recent works, where binary variables are often introduced to model the complementary nature of battery charging and discharging. A conventional approach for these
Externí odkaz:
http://arxiv.org/abs/2402.04406
The classical Canonical Correlation Analysis (CCA) identifies the correlations between two sets of multivariate variables based on their covariance, which has been widely applied in diverse fields such as computer vision, natural language processing,
Externí odkaz:
http://arxiv.org/abs/2401.00308
We consider sensitivity analysis for Mixed Binary Quadratic Programs (MBQPs) with respect to changing right-hand-sides (rhs). We show that even if the optimal solution of a given MBQP is known, it is NP-hard to approximate the change in objective fun
Externí odkaz:
http://arxiv.org/abs/2312.06714
Gas networks are used to transport natural gas, which is an important resource for both residential and industrial customers throughout the world. The gas network design problem is generally modelled as a nonconvex mixed-integer nonlinear integer pro
Externí odkaz:
http://arxiv.org/abs/2307.07648
We consider the variable selection problem for two-sample tests, aiming to select the most informative variables to distinguish samples from two groups. To solve this problem, we propose a framework based on the kernel maximum mean discrepancy (MMD).
Externí odkaz:
http://arxiv.org/abs/2302.07415
We study properties of the convex hull of a set $S$ described by quadratic inequalities. A simple way of generating inequalities valid on $S$ is to take a nonnegative linear combinations of the defining inequalities of $S$. We call such inequalities
Externí odkaz:
http://arxiv.org/abs/2210.01722
In many operational applications, it is necessary to routinely find, within a very limited time window, provably good solutions to challenging mixed-integer linear programming (MILP) problems. An example is the Security-Constrained Unit Commitment (S
Externí odkaz:
http://arxiv.org/abs/2208.10028
Recently, we proposed a class of inequalities called lifted bilinear cover inequalities, which are second-order cone representable convex inequalities, and are valid for a set described by a separable bilinear constraint together with bounds on varia
Externí odkaz:
http://arxiv.org/abs/2208.00345
The benefits of transmission line switching are well-known in terms of reducing operational cost and improving system reliability of power systems. However, finding the optimal power network configuration is a challenging task due to the combinatoria
Externí odkaz:
http://arxiv.org/abs/2112.13209