A new decomposition approach for the single machine total tardiness scheduling problem. - Federico Della Croce; Roberto Tadei; Paolo Baracco; Andrea Grosso (J. Oper. Res. Soc., 1998)

Optimal design of logical topologies in wavelength-routed optical networks with multicast traffic. - Marco Mellia; Antonio Nucci; Andrea Grosso; Emilio Leonardi; Marco Ajmone Marsan (GLOBECOM, 2001)

Logical topologies design over WDM wavelength routed networks robust to traffic uncertainties. - Andrea Grosso; Emilio Leonardi; Marco Mellia; Antonio Nucci (IEEE Commun. Lett., 2001)

Optimal facility location with random throughput costs. - Nicoletta Ricciardi; Roberto Tadei; Andrea Grosso (Comput. Oper. Res., 2002)

Finding the Pareto-optima for the total and maximum tardiness single machine problem. - Roberto Tadei; Andrea Grosso; Federico Della Croce (Discret. Appl. Math., 2002)

Design of Logical Topologies in Wavelength-Routed IP Networks. - Marco Ajmone Marsan; Emilio Leonardi; Marco Mellia; Antonio Nucci; Andrea Grosso (Photonic Netw. Commun., 2002)

Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem. - Andrea Grosso; Marco Locatelli 001; Federico Della Croce (J. Heuristics, 2004)

An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem. - Andrea Grosso; Federico Della Croce; Roberto Tadei (Oper. Res. Lett., 2004)

Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem. - Federico Della Croce; Andrea Grosso; Vangelis Th. Paschos (J. Sched., 2004)

A "maximum node clustering" problem. - Giuliana Carello; Federico Della Croce; Andrea Grosso; Marco Locatelli 001 (J. Comb. Optim., 2006)

An experimental analysis of a population based approach for global optimization. - Andrea Grosso; Marco Locatelli 001; Fabio Schoen (Comput. Optim. Appl., 2007)

A Population-based Approach for Hard Global Optimization Problems based on Dissimilarity Measures. - Andrea Grosso; Marco Locatelli 001; Fabio Schoen (Math. Program., 2007)

Simple ingredients leading to very efficient heuristics for the maximum clique problem. - Andrea Grosso; Marco Locatelli 001; Wayne J. Pullan (J. Heuristics, 2008)

Solving molecular distance geometry problems by global optimization algorithms. - Andrea Grosso; Marco Locatelli 001; Fabio Schoen (Comput. Optim. Appl., 2009)

A heuristic approach for the max-min diversity problem based on max-clique. - Federico Della Croce; Andrea Grosso; Marco Locatelli 001 (Comput. Oper. Res., 2009)

Finding maximin latin hypercube designs by Iterated Local Search heuristics. - Andrea Grosso; A. R. M. J. U. Jamali; Marco Locatelli 001 (Eur. J. Oper. Res., 2009)

Modelling and Optimization of Cross-Media Production Processes. - Pietro Piazzolla; Andrea Grosso; Marco Gribaudo; Alberto Messina (OR, 2010)

Solving the problem of packing equal and unequal circles in a circular container. - Andrea Grosso; A. R. M. J. U. Jamali; Marco Locatelli 001; Fabio Schoen (J. Glob. Optim., 2010)

Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances. - Philippe Baptiste; Federico Della Croce; Andrea Grosso; Vincent T'kindt (J. Sched., 2010)

A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem. - Federico Della Croce; Andrea Grosso; Fabio Salassa (EvoCOP, 2011)

Computational experience with a core-based reduction procedure for the 2-knapsack problem. - Federico Della Croce; Andrea Grosso (Comput. Oper. Res., 2011)

Complexity of the critical node problem over trees. - Marco Di Summa; Andrea Grosso; Marco Locatelli 001 (Comput. Oper. Res., 2011)

Branch and cut algorithms for detecting critical nodes in undirected graphs. - Marco Di Summa; Andrea Grosso; Marco Locatelli 001 (Comput. Optim. Appl., 2012)

Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem. - Federico Della Croce; Andrea Grosso (Comput. Oper. Res., 2012)

Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem. - Federico Della Croce; Thierry Garaix; Andrea Grosso (Comput. Oper. Res., 2012)

Neural networks for wind power generation forecasting: A case study. - Rossella Cancelliere; Alberto Gosso; Andrea Grosso (ICNSC, 2013)

Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth. - Bernardetta Addis; Marco Di Summa; Andrea Grosso (Discret. Appl. Math., 2013)

Computational Experience with Pseudoinversion-Based Training of Neural Networks Using Random Projection Matrices. - Luca Rubini; Rossella Cancelliere; Patrick Gallinari; Andrea Grosso; Antonino Raiti (AIMSA, 2014)

A matheuristic approach for the two-machine total completion time flow shop problem. - Federico Della Croce; Andrea Grosso; Fabio Salassa (Ann. Oper. Res., 2014)

VNS solutions for the Critical Node Problem. - Roberto Aringhieri; Andrea Grosso; Pierre Hosteins; Rosario Scatamacchia (Electron. Notes Discret. Math., 2015)

Construction and improvement algorithms for dispersion problems. - Roberto Aringhieri; Roberto Cordone; Andrea Grosso (Eur. J. Oper. Res., 2015)

A single machine scheduling problem with two-dimensional vector packing constraints. - Jean-Charles Billaut; Federico Della Croce; Andrea Grosso (Eur. J. Oper. Res., 2015)

Hybrid constructive heuristics for the critical node problem. - Bernardetta Addis; Roberto Aringhieri; Andrea Grosso; Pierre Hosteins (Ann. Oper. Res., 2016)

A general Evolutionary Framework for different classes of Critical Node Problems. - Roberto Aringhieri; Andrea Grosso; Pierre Hosteins; Rosario Scatamacchia (Eng. Appl. Artif. Intell., 2016)

A Genetic Algorithm for a class of Critical Node Problems. - Roberto Aringhieri; Andrea Grosso; Pierre Hosteins (Electron. Notes Discret. Math., 2016)

A preliminary analysis of the Distance Based Critical Node Problem. - Roberto Aringhieri; Andrea Grosso; Pierre Hosteins; Rosario Scatamacchia (Electron. Notes Discret. Math., 2016)

Local search and pseudoinversion: an hybrid approach to neural network training. - Luca Rubini; Rossella Cancelliere; Patrick Gallinari; Andrea Grosso (Knowl. Inf. Syst., 2016)

Local search metaheuristics for the critical node problem. - Roberto Aringhieri; Andrea Grosso; Pierre Hosteins; Rosario Scatamacchia (Networks, 2016)

Searching for a cycle with maximum coverage in undirected graphs. - Andrea Grosso; Fabio Salassa; Wim Vancroonenburg (Optim. Lett., 2016)

Simple but effective heuristics for the 2-constraint bin packing problem. - Roberto Aringhieri; Davide Duma; Andrea Grosso; Pierre Hosteins (J. Heuristics, 2018)

Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem. - Roberto Aringhieri; Andrea Grosso; Pierre Hosteins; Rosario Scatamacchia (Discret. Appl. Math., 2019)

Minimizing total completion time in the two-machine no-idle no-wait flow shop problem. - Federico Della Croce; Andrea Grosso; Fabio Salassa (J. Heuristics, 2021)

Column generation for minimizing total completion time in a parallel-batching environment. - Arianna Alfieri; Alessandro Druetto; Andrea Grosso; Fabio Salassa (J. Sched., 2021)

Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine. - Alessandro Druetto; Andrea Grosso (Comput. Oper. Res., 2022)

The Connected Critical Node Problem. - Pierre Hosteins; Rosario Scatamacchia; Andrea Grosso; Roberto Aringhieri (Theor. Comput. Sci., 2022)

Job Shop Scheduling via Deep Reinforcement Learning: A Sequence to Sequence Approach. - Giovanni Bonetta; Davide Zago; Rossella Cancelliere; Andrea Grosso (LION, 2023)

Task and Memory Mapping of Large Size Embedded Applications over NUMA architecture✱. - Alessandro Druetto; Enrico Bini; Andrea Grosso; Stefano Puri; Silvio Bacci; Marco Di Natale; Francesco Paladino (RTNS, 2023)

The daily swab test collection problem. - Roberto Aringhieri; Sara Bigharaz; Alessandro Druetto; Davide Duma; Andrea Grosso; Alberto Guastalla (Ann. Oper. Res., 2024)

Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server. - Alessandro Druetto; Andrea Grosso; Jully Jeunet; Fabio Salassa (Comput. Oper. Res., 2025)

A note on "Self-adaptive General Variable Neighborhood Search algorithm for parallel machine scheduling with unrelated servers". - Andrea Grosso; Fabio Salassa (Comput. Oper. Res., 2025)