Andrea Grosso

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