2 citations · 2 across the 2 of their papers we have counts for
3 papers
Finding First and Most-Beautiful Queens by Integer Programming
Matteo Fischetti, Domenico Salvagnin
The n-queens puzzle is a well-known combinatorial problem that requires to place n queens on an n x n chessboard so that no two queens can attack each other. Since the 19th century…
Faster SGD training by minibatch persistency
Matteo Fischetti, Iacopo Mandatelli, Domenico Salvagnin
It is well known that, for most datasets, the use of large-size minibatches for Stochastic Gradient Descent (SGD) typically leads to slow convergence and poor generalization. On th…
Improving the Randomization Step in Feasibility Pump
Santanu S. Dey, Andres Iroume, Marco Molinaro +1
Feasibility pump (FP) is a successful primal heuristic for mixed-integer linear programs (MILP). The algorithm consists of three main components: rounding fractional solution to a…