default search action
Andrea Grosso
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j41]Roberto Aringhieri
, Sara Bigharaz, Alessandro Druetto
The daily swab test collection problem. Ann. Oper. Res. 335(3): 1449-1470 (2024) - 2023
- [c7]Giovanni Bonetta
Job Shop Scheduling via Deep Reinforcement Learning: A Sequence to Sequence Approach. LION 2023: 475-490 - [c6]Alessandro Druetto
Task and Memory Mapping of Large Size Embedded Applications over NUMA architecture✱. RTNS 2023: 166-176 - [i2]Giovanni Bonetta, Davide Zago, Rossella Cancelliere, Andrea Grosso:
Job Shop Scheduling via Deep Reinforcement Learning: a Sequence to Sequence approach. CoRR abs/2308.01797 (2023) - 2022
- [j40]Alessandro Druetto
Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine. Comput. Oper. Res. 139: 105639 (2022) - [j39]Pierre Hosteins
The Connected Critical Node Problem. Theor. Comput. Sci. 923: 235-255 (2022) - 2021
- [j38]Federico Della Croce
Minimizing total completion time in the two-machine no-idle no-wait flow shop problem. J. Heuristics 27(1-2): 159-173 (2021) - [j37]Arianna Alfieri, Alessandro Druetto
Column generation for minimizing total completion time in a parallel-batching environment. J. Sched. 24(6): 569-588 (2021)
2010 – 2019
- 2019
- [j36]Roberto Aringhieri
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem. Discret. Appl. Math. 253: 103-121 (2019) - 2018
- [j35]Roberto Aringhieri
Simple but effective heuristics for the 2-constraint bin packing problem. J. Heuristics 24(3): 345-357 (2018) - [i1]Federico Della Croce, Thierry Garaix, Andrea Grosso:
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem. CoRR abs/1811.02882 (2018) - 2016
- [j34]Bernardetta Addis
Hybrid constructive heuristics for the critical node problem. Ann. Oper. Res. 238(1-2): 637-649 (2016) - [j33]Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia:
A general Evolutionary Framework for different classes of Critical Node Problems. Eng. Appl. Artif. Intell. 55: 128-145 (2016) - [j32]Roberto Aringhieri
A Genetic Algorithm for a class of Critical Node Problems. Electron. Notes Discret. Math. 52: 359-366 (2016) - [j31]Roberto Aringhieri
A preliminary analysis of the Distance Based Critical Node Problem. Electron. Notes Discret. Math. 55: 25-28 (2016) - [j30]Luca Rubini, Rossella Cancelliere, Patrick Gallinari, Andrea Grosso:
Local search and pseudoinversion: an hybrid approach to neural network training. Knowl. Inf. Syst. 48(2): 493-503 (2016) - [j29]Roberto Aringhieri
Local search metaheuristics for the critical node problem. Networks 67(3): 209-221 (2016) - [j28]Andrea Grosso, Fabio Salassa
Searching for a cycle with maximum coverage in undirected graphs. Optim. Lett. 10(7): 1493-1504 (2016) - 2015
- [j27]Roberto Aringhieri
VNS solutions for the Critical Node Problem. Electron. Notes Discret. Math. 47: 37-44 (2015) - [j26]Roberto Aringhieri
Construction and improvement algorithms for dispersion problems. Eur. J. Oper. Res. 242(1): 21-33 (2015) - [j25]Jean-Charles Billaut, Federico Della Croce
A single machine scheduling problem with two-dimensional vector packing constraints. Eur. J. Oper. Res. 243(1): 75-81 (2015) - 2014
- [j24]Federico Della Croce
A matheuristic approach for the two-machine total completion time flow shop problem. Ann. Oper. Res. 213(1): 67-78 (2014) - [c5]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: 236-245 - 2013
- [j23]Bernardetta Addis
Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth. Discret. Appl. Math. 161(16-17): 2349-2360 (2013) - [c4]Rossella Cancelliere, Alberto Gosso, Andrea Grosso:
Neural networks for wind power generation forecasting: A case study. ICNSC 2013: 666-671 - 2012
- [j22]Marco Di Summa, Andrea Grosso, Marco Locatelli
Branch and cut algorithms for detecting critical nodes in undirected graphs. Comput. Optim. Appl. 53(3): 649-680 (2012) - [j21]Federico Della Croce
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem. Comput. Oper. Res. 39(1): 27-31 (2012) - [j20]Federico Della Croce
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem. Comput. Oper. Res. 39(6): 1213-1217 (2012) - 2011
- [j19]Federico Della Croce
Computational experience with a core-based reduction procedure for the 2-knapsack problem. Comput. Oper. Res. 38(2): 514-516 (2011) - [j18]Marco Di Summa, Andrea Grosso, Marco Locatelli
Complexity of the critical node problem over trees. Comput. Oper. Res. 38(12): 1766-1774 (2011) - [c3]Federico Della Croce
A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem. EvoCOP 2011: 38-47 - 2010
- [j17]Andrea Grosso, A. R. M. J. U. Jamali, Marco Locatelli
Solving the problem of packing equal and unequal circles in a circular container. J. Glob. Optim. 47(1): 63-81 (2010) - [j16]Philippe Baptiste, Federico Della Croce
Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances. J. Sched. 13(1): 39-47 (2010) - [c2]Pietro Piazzolla
Modelling and Optimization of Cross-Media Production Processes. OR 2010: 157-162
2000 – 2009
- 2009
- [j15]Andrea Grosso, Marco Locatelli
Solving molecular distance geometry problems by global optimization algorithms. Comput. Optim. Appl. 43(1): 23-37 (2009) - [j14]Federico Della Croce
A heuristic approach for the max-min diversity problem based on max-clique. Comput. Oper. Res. 36(8): 2429-2433 (2009) - [j13]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): 541-547 (2009) - 2008
- [j12]Andrea Grosso, Marco Locatelli
Simple ingredients leading to very efficient heuristics for the maximum clique problem. J. Heuristics 14(6): 587-612 (2008) - 2007
- [j11]Andrea Grosso, Marco Locatelli
An experimental analysis of a population based approach for global optimization. Comput. Optim. Appl. 38(3): 351-370 (2007) - [j10]Andrea Grosso, Marco Locatelli
A Population-based Approach for Hard Global Optimization Problems based on Dissimilarity Measures. Math. Program. 110(2): 373-404 (2007) - 2006
- [j9]Giuliana Carello
A "maximum node clustering" problem. J. Comb. Optim. 11(4): 373-385 (2006) - 2004
- [j8]Andrea Grosso, Marco Locatelli
Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem. J. Heuristics 10(2): 135-152 (2004) - [j7]Andrea Grosso, Federico Della Croce
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem. Oper. Res. Lett. 32(1): 68-72 (2004) - [j6]Federico Della Croce
Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem. J. Sched. 7(1): 85-91 (2004) - 2002
- [j5]Nicoletta Ricciardi, Roberto Tadei
Optimal facility location with random throughput costs. Comput. Oper. Res. 29(6): 593-607 (2002) - [j4]Roberto Tadei
Finding the Pareto-optima for the total and maximum tardiness single machine problem. Discret. Appl. Math. 124(1-3): 117-126 (2002) - [j3]Marco Ajmone Marsan, Emilio Leonardi
Design of Logical Topologies in Wavelength-Routed IP Networks. Photonic Netw. Commun. 4(3-4): 423-442 (2002) - 2001
- [j2]Andrea Grosso, Emilio Leonardi
Logical topologies design over WDM wavelength routed networks robust to traffic uncertainties. IEEE Commun. Lett. 5(4): 172-174 (2001) - [c1]Marco Mellia
Optimal design of logical topologies in wavelength-routed optical networks with multicast traffic. GLOBECOM 2001: 1520-1525
1990 – 1999
- 1998
- [j1]Federico Della Croce
A new decomposition approach for the single machine total tardiness scheduling problem. J. Oper. Res. Soc. 49(10): 1101-1106 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: