2 citations · 4 across the 8 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Breaking symmetries to rescue Sum of Squares in the case of makespan scheduling
Victor Verdugo, José Verschae, Andreas Wiese
The Sum of Squares (\sos{}) hierarchy gives an automatized technique to create a family of increasingly tight convex relaxations for binary programs. There are several problems for…
cs.DS2018
Strong Algorithms for the Ordinal Matroid Secretary Problem
José A. Soto, Abner Turkieltaub, Victor Verdugo
In the ordinal Matroid Secretary Problem (MSP), elements from a weighted matroid are presented in random order to an algorithm that must incrementally select a large weight indepen…