Andrea Grosso
Orcid: 0000-0002-9926-2443
According to our database1,
Andrea Grosso
authored at least 47 papers
between 1998 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Proceedings of the 31st International Conference on Real-Time Networks and Systems, 2023
Job Shop Scheduling via Deep Reinforcement Learning: A Sequence to Sequence Approach.
Proceedings of the Learning and Intelligent Optimization - 17th International Conference, 2023
2022
Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine.
Comput. Oper. Res., 2022
2021
Column generation for minimizing total completion time in a parallel-batching environment.
J. Sched., 2021
Minimizing total completion time in the two-machine no-idle no-wait flow shop problem.
J. Heuristics, 2021
2019
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem.
Discret. Appl. Math., 2019
2018
J. Heuristics, 2018
2016
Knowl. Inf. Syst., 2016
Electron. Notes Discret. Math., 2016
Electron. Notes Discret. Math., 2016
Eng. Appl. Artif. Intell., 2016
2015
Eur. J. Oper. Res., 2015
Eur. J. Oper. Res., 2015
2014
Ann. Oper. Res., 2014
Computational Experience with Pseudoinversion-Based Training of Neural Networks Using Random Projection Matrices.
Proceedings of the Artificial Intelligence: Methodology, Systems, and Applications, 2014
2013
Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth.
Discret. Appl. Math., 2013
Proceedings of 10th IEEE International Conference on Networking, Sensing and Control, 2013
2012
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem.
Comput. Oper. Res., 2012
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem.
Comput. Oper. Res., 2012
Comput. Optim. Appl., 2012
2011
Computational experience with a core-based reduction procedure for the 2-knapsack problem.
Comput. Oper. Res., 2011
A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2011
2010
Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances.
J. Sched., 2010
J. Glob. Optim., 2010
Proceedings of the Operations Research Proceedings 2010, 2010
2009
Eur. J. Oper. Res., 2009
Comput. Oper. Res., 2009
Comput. Optim. Appl., 2009
2008
Simple ingredients leading to very efficient heuristics for the maximum clique problem.
J. Heuristics, 2008
2007
A Population-based Approach for Hard Global Optimization Problems based on Dissimilarity Measures.
Math. Program., 2007
Comput. Optim. Appl., 2007
2006
2004
Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem.
J. Sched., 2004
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem.
Oper. Res. Lett., 2004
Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem.
J. Heuristics, 2004
2002
Photonic Netw. Commun., 2002
Finding the Pareto-optima for the total and maximum tardiness single machine problem.
Discret. Appl. Math., 2002
2001
Logical topologies design over WDM wavelength routed networks robust to traffic uncertainties.
IEEE Commun. Lett., 2001
Optimal design of logical topologies in wavelength-routed optical networks with multicast traffic.
Proceedings of the Global Telecommunications Conference, 2001
1998
A new decomposition approach for the single machine total tardiness scheduling problem.
J. Oper. Res. Soc., 1998