6 citations · 12 across the 8 of their papers we have counts for
9 papers
A Lock-Free Work-Stealing Algorithm for Bulk Operations
Raja Sai Nandhan Yadav Kataru, Danial Davarnia, Ali Jannesari
Work-stealing is a widely used technique for balancing irregular parallel workloads, and most modern runtime systems adopt lock-free work-stealing deques to reduce contention and i…
A Unifying Convexification Framework for Chance-Constrained Programs with Finite Support via Bilinear Formulations over a Simplex
Danial Davarnia, Hamed Rahimian
Chance-constrained programming is a widely used framework for decision-making under uncertainty, yet its mixed-integer reformulations over a finite support involve nonconvex mixing…
A Graphical Global Optimization Framework for Parameter Estimation of Statistical Models with Nonconvex Regularization Functions
Danial Davarnia, Mohammadreza Kiaghadi
Optimization problems with norm-bounding constraints arise in a variety of applications, including portfolio optimization, machine learning, and feature selection. A common approac…
A graphical framework for global optimization of mixed-integer nonlinear programs
Danial Davarnia, Mohammadreza Kiaghadi, Junyuan Qiu
While mixed-integer linear programming and convex programming solvers have advanced significantly over the past several decades, solution technologies for general mixed-integer non…
Solving a Class of Cut-Generating Linear Programs via Machine Learning
Atefeh Rajabalizadeh, Danial Davarnia
Cut-generating linear programs (CGLPs) play a key role as a separation oracle to produce valid inequalities for the feasible region of mixed-integer programs. When incorporated ins…
Convexification of bilinear terms over network polytopes
Erfan Khademnia, Danial Davarnia
It is well-known that the McCormick relaxation for the bilinear constraint gives the convex hull over the box domains for and . In network applications where the doma…
Solving Unsplittable Network Flow Problems with Decision Diagrams
Hosseinali Salemi, Danial Davarnia
In unsplittable network flow problems, certain nodes must satisfy a combinatorial requirement that the incoming arc flows cannot be split or merged when routed through outgoing arc…
On the Structure of Decision Diagram-Representable Mixed Integer Programs with Application to Unit Commitment
Hosseinali Salemi, Danial Davarnia
Over the past decade, decision diagrams (DDs) have been used to model and solve integer programming and combinatorial optimization problems. Despite successful performance of DDs i…
Consistency for 0-1 Programming
Danial Davarnia, J. N. Hooker
Concepts of consistency have long played a key role in constraint programming but never developed in integer programming (IP). Consistency nonetheless plays a role in IP as well. F…