Andrea Grosso

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 21

Top Topics

Top Venues

Ann. Oper. Res.

Electron. Notes Discret. Math.

Publications

Roberto Aringhieri, Sara Bigharaz, Alessandro Druetto, Davide Duma, Andrea Grosso, Alberto Guastalla
The daily swab test collection problem. Ann. Oper. Res. 335 (3) (2024)
Giovanni Bonetta, Davide Zago, Rossella Cancelliere, Andrea Grosso
Job Shop Scheduling via Deep Reinforcement Learning: A Sequence to Sequence Approach. LION (2023)
Alessandro Druetto, Enrico Bini, Andrea Grosso, Stefano Puri, Silvio Bacci, Marco Di Natale, Francesco Paladino
Task and Memory Mapping of Large Size Embedded Applications over NUMA architecture✱. RTNS (2023)
Giovanni Bonetta, Davide Zago, Rossella Cancelliere, Andrea Grosso
Job Shop Scheduling via Deep Reinforcement Learning: a Sequence to Sequence approach. CoRR (2023)
Alessandro Druetto, Andrea Grosso
Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine. Comput. Oper. Res. 139 (2022)
Pierre Hosteins, Rosario Scatamacchia, Andrea Grosso, Roberto Aringhieri
The Connected Critical Node Problem. Theor. Comput. Sci. 923 (2022)
Arianna Alfieri, Alessandro Druetto, Andrea Grosso, Fabio Salassa
Column generation for minimizing total completion time in a parallel-batching environment. J. Sched. 24 (6) (2021)
Federico Della Croce, Andrea Grosso, Fabio Salassa
Minimizing total completion time in the two-machine no-idle no-wait flow shop problem. J. Heuristics 27 (1-2) (2021)
Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem. Discret. Appl. Math. 253 (2019)
Federico Della Croce, Thierry Garaix, Andrea Grosso
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem. CoRR (2018)
Roberto Aringhieri, Davide Duma, Andrea Grosso, Pierre Hosteins
Simple but effective heuristics for the 2-constraint bin packing problem. J. Heuristics 24 (3) (2018)
Bernardetta Addis, Roberto Aringhieri, Andrea Grosso, Pierre Hosteins
Hybrid constructive heuristics for the critical node problem. Ann. Oper. Res. 238 (1-2) (2016)
Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia
A general Evolutionary Framework for different classes of Critical Node Problems. Eng. Appl. Artif. Intell. 55 (2016)
Roberto Aringhieri, Andrea Grosso, Pierre Hosteins
A Genetic Algorithm for a class of Critical Node Problems. Electron. Notes Discret. Math. 52 (2016)
Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia
A preliminary analysis of the Distance Based Critical Node Problem. Electron. Notes Discret. Math. 55 (2016)
Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia
Local search metaheuristics for the critical node problem. Networks 67 (3) (2016)
Andrea Grosso, Fabio Salassa, Wim Vancroonenburg
Searching for a cycle with maximum coverage in undirected graphs. Optim. Lett. 10 (7) (2016)
Luca Rubini, Rossella Cancelliere, Patrick Gallinari, Andrea Grosso
Local search and pseudoinversion: an hybrid approach to neural network training. Knowl. Inf. Syst. 48 (2) (2016)
Jean-Charles Billaut, Federico Della Croce, Andrea Grosso
A single machine scheduling problem with two-dimensional vector packing constraints. Eur. J. Oper. Res. 243 (1) (2015)
Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia
VNS solutions for the Critical Node Problem. Electron. Notes Discret. Math. 47 (2015)
Roberto Aringhieri, Roberto Cordone, Andrea Grosso
Construction and improvement algorithms for dispersion problems. Eur. J. Oper. Res. 242 (1) (2015)
Federico Della Croce, Andrea Grosso, Fabio Salassa
A matheuristic approach for the two-machine total completion time flow shop problem. Ann. Oper. Res. 213 (1) (2014)
Luca Rubini, Rossella Cancelliere, Patrick Gallinari, Andrea Grosso, Antonino Raiti
Computational Experience with Pseudoinversion-Based Training of Neural Networks Using Random Projection Matrices. AIMSA (2014)
Rossella Cancelliere, Alberto Gosso, Andrea Grosso
Neural networks for wind power generation forecasting: A case study. ICNSC (2013)
Bernardetta Addis, Marco Di Summa, Andrea Grosso
Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth. Discret. Appl. Math. 161 (16-17) (2013)
Federico Della Croce, Thierry Garaix, Andrea Grosso
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem. Comput. Oper. Res. 39 (6) (2012)
Marco Di Summa, Andrea Grosso, Marco Locatelli
Branch and cut algorithms for detecting critical nodes in undirected graphs. Comput. Optim. Appl. 53 (3) (2012)
Federico Della Croce, Andrea Grosso
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem. Comput. Oper. Res. 39 (1) (2012)
Federico Della Croce, Andrea Grosso
Computational experience with a core-based reduction procedure for the 2-knapsack problem. Comput. Oper. Res. 38 (2) (2011)
Marco Di Summa, Andrea Grosso, Marco Locatelli
Complexity of the critical node problem over trees. Comput. Oper. Res. 38 (12) (2011)
Federico Della Croce, Andrea Grosso, Fabio Salassa
A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem. EvoCOP (2011)
Philippe Baptiste, Federico Della Croce, Andrea Grosso, Vincent T'kindt
Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances. J. Sched. 13 (1) (2010)
Pietro Piazzolla, Andrea Grosso, Marco Gribaudo, Alberto Messina
Modelling and Optimization of Cross-Media Production Processes. OR (2010)
Andrea Grosso, A. R. M. J. U. Jamali, Marco Locatelli, Fabio Schoen
Solving the problem of packing equal and unequal circles in a circular container. J. Glob. Optim. 47 (1) (2010)
Federico Della Croce, Andrea Grosso, Marco Locatelli
A heuristic approach for the max-min diversity problem based on max-clique. Comput. Oper. Res. 36 (8) (2009)
Andrea Grosso, Marco Locatelli, Fabio Schoen
Solving molecular distance geometry problems by global optimization algorithms. Comput. Optim. Appl. 43 (1) (2009)
Andrea Grosso, A. R. M. J. U. Jamali, Marco Locatelli
Finding maximin latin hypercube designs by Iterated Local Search heuristics. Eur. J. Oper. Res. 197 (2) (2009)
Andrea Grosso, Marco Locatelli, Wayne J. Pullan
Simple ingredients leading to very efficient heuristics for the maximum clique problem. J. Heuristics 14 (6) (2008)
Andrea Grosso, Marco Locatelli, Fabio Schoen
A Population-based Approach for Hard Global Optimization Problems based on Dissimilarity Measures. Math. Program. 110 (2) (2007)
Andrea Grosso, Marco Locatelli, Fabio Schoen
An experimental analysis of a population based approach for global optimization. Comput. Optim. Appl. 38 (3) (2007)
Giuliana Carello, Federico Della Croce, Andrea Grosso, Marco Locatelli
A "maximum node clustering" problem. J. Comb. Optim. 11 (4) (2006)
Federico Della Croce, Andrea Grosso, Vangelis Th. Paschos
Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem. J. Sched. 7 (1) (2004)
Andrea Grosso, Federico Della Croce, Roberto Tadei
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem. Oper. Res. Lett. 32 (1) (2004)
Andrea Grosso, Marco Locatelli, Federico Della Croce
Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem. J. Heuristics 10 (2) (2004)
Nicoletta Ricciardi, Roberto Tadei, Andrea Grosso
Optimal facility location with random throughput costs. Comput. Oper. Res. 29 (6) (2002)
Marco Ajmone Marsan, Emilio Leonardi, Marco Mellia, Antonio Nucci, Andrea Grosso
Design of Logical Topologies in Wavelength-Routed IP Networks. Photonic Netw. Commun. 4 (3-4) (2002)
Roberto Tadei, Andrea Grosso, Federico Della Croce
Finding the Pareto-optima for the total and maximum tardiness single machine problem. Discret. Appl. Math. 124 (1-3) (2002)
Marco Mellia, Antonio Nucci, Andrea Grosso, Emilio Leonardi, Marco Ajmone Marsan
Optimal design of logical topologies in wavelength-routed optical networks with multicast traffic. GLOBECOM (2001)
Andrea Grosso, Emilio Leonardi, Marco Mellia, Antonio Nucci
Logical topologies design over WDM wavelength routed networks robust to traffic uncertainties. IEEE Commun. Lett. 5 (4) (2001)
Federico Della Croce, Roberto Tadei, Paolo Baracco, Andrea Grosso
A new decomposition approach for the single machine total tardiness scheduling problem. J. Oper. Res. Soc. 49 (10) (1998)