2 papers
cs.LG2026
Sharp Low-Degree Thresholds for Planted-vs-Planted Testing
Anda Skeja, Daniel Gutiérrez Espinoza, Fiona Skerman +1
We establish the first sharp thresholds for low-degree polynomial tests in planted-vs-planted settings, where the goal is to determine with vanishing error which of two structured…
math.OC2016
A study of the Bienstock-Zuckerberg algorithm, Applications in Mining and Resource Constrained Project Scheduling
Gonzalo Muñoz, Daniel Espinoza, Marcos Goycoolea +3
We study a Lagrangian decomposition algorithm recently proposed by Dan Bienstock and Mark Zuckerberg for solving the LP relaxation of a class of open pit mine project scheduling pr…