60 citations · 75 across the 5 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
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…
cs.LG2019★ 13 cited
Embedded hyper-parameter tuning by Simulated Annealing
Matteo Fischetti, Matteo Stringher
We propose a new metaheuristic training scheme that combines Stochastic Gradient Descent (SGD) and Discrete Optimization in an unconventional way. Our idea is to define a discrete…