Zobrazeno 1 - 10
of 307
pro vyhledávání: '"Dey, Santanu S"'
Many operations related optimization problems involve repeatedly solving similar mixed integer linear programming (MILP) instances with the same constraint matrix but differing objective coefficients and right-hand-side values. The goal of this paper
Externí odkaz:
http://arxiv.org/abs/2411.15090
For mixed integer programs (MIPs) with block structures and coupling constraints, on dualizing the coupling constraints the resulting Lagrangian relaxation becomes decomposable into blocks which allows for the use of parallel computing. However, the
Externí odkaz:
http://arxiv.org/abs/2411.12085
In this paper, we study the strength of convex relaxations obtained by convexification of aggregation of constraints for a set $S$ described by two bilinear bipartite equalities. Aggregation is the process of rescaling the original constraints by sca
Externí odkaz:
http://arxiv.org/abs/2410.14163
When branching for binary mixed integer linear programs with disjunctions of sparsity level $2$, we observe that there exists a finite list of $2$-sparse disjunctions, such that any other $2$-sparse disjunction is dominated by one disjunction in this
Externí odkaz:
http://arxiv.org/abs/2408.05392
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