5 papers · 1 filter
GPU-friendly and Linearly Convergent First-order Methods for Certifying Optimal -sparse GLMs
Jiachang Liu, Andrea Lodi, Soroosh Shafiee
We investigate the problem of certifying optimality for sparse generalized linear models (GLMs), where sparsity is enforced through a cardinality constraint. While Branch-and-Bound…
Cutting Planes for Binarized Network Flow Problems
Pierre Bonami, Sanjeeb Dash, Anton Derkach +1
We consider integer programming problems with bounded general-integer variables belonging to the general class of network flow problems. For those, we computationally investigate t…
Electric Vehicle Scheduling and Vehicle-to-Grid Integration in Microgrids
Nathan Cho, Andrea Lodi, Anna Scaglione
We jointly schedule electric trucks and stationary batteries in an isolated microgrid with solar and fossil generation. Truck routes determine when their batteries can charge or re…
How hard is learning to cut? Trade-offs and sample complexity
Sammy Khalife, Andrea Lodi
In the recent years, branch-and-cut algorithms have been the target of data-driven approaches designed to enhance the decision making in different phases of the algorithm such as b…
The Differentiable Feasibility Pump
Matteo Cacciola, Alexandre Forel, Antonio Frangioni +1
Although nearly 20 years have passed since its conception, the feasibility pump algorithm remains a widely used heuristic to find feasible primal solutions to mixed-integer linear…