GROSSO, Andrea Cesare

GROSSO, Andrea Cesare  

INFORMATICA  

Mostra records
Risultati 1 - 20 di 64 (tempo di esecuzione: 0.04 secondi).
Titolo Data di pubblicazione Autore(i) File
A General Evolutionary Framework for different classes of Critical Node Problems 2016 Aringhieri, Roberto; Grosso, Andrea; Hosteins, Pierre; Scatamacchia, Rosario
A Genetic Algorithm for a class of Critical Node Problems 2016 Aringhieri, Roberto; Grosso, Andrea; Hosteins, Pierre
A heuristic approach for the max–min diversity problem based on max-clique 2009 F. DELLA CROCE; A. GROSSO; M. LOCATELLI
A Hybrid Algorithm based on Gray Petri Net and Tabu Search for staffing Health Care Personnel 2012 Bernardetta Addis; Roberto Aringhieri; Marco Gribaudo; Andrea Grosso
A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem 2011 F. DELLA CROCE; A. GROSSO; F. SALASSA
A matheuristic approach for the two-machine total completion time flow shop problem 2014 Federico Della Croce; Andrea Grosso; Fabio Salassa
A maximum node clustering problem 2006 G. CARELLO; F. DELLA CROCE; A. GROSSO; M. LOCATELLI
A new decomposition approach for the single-machine total tardiness problem 1998 TADEI R; DELLA CROCE F; BARACCO P; A. GROSSO
A population based approach for hard global optimization problems based on dissimilarity measures 2007 A. GROSSO; M. LOCATELLI; F. SCHOEN
A preliminary analysis of the Distance Based Critical Node Problem 2016 Aringhieri, Roberto; Grosso, Andrea; Hosteins, Pierre; Scatamacchia, Rosario
A single machine scheduling problem with two-dimensional vector packing constraints 2015 J.-C. Billaut; F. Della Croce; A. Grosso
Advanced workforce management in healthcare 2011 Bernardetta Addis; Roberto Aringhieri; Giuliana Carello; Marco Gribaudo; Andrea Grosso
Algorithmic paradoxes of the single machine total tardiness problem 2001 SZWARC W; A. GROSSO; DELLA CROCE F
An enhanced dynasearch neighborhood for the single machine total weighted tardiness scheduling problem 2004 A. GROSSO; F. DELLA CROCE; R. TADEI
An experimental analysis of a population based approach for global optimization 2007 A. GROSSO; M. LOCATELLI; F. SCHOEN
Branch and cut algorithms for detecting critical nodes in undirected graphs 2012 Marco Di Summa; Andrea Grosso; Marco Locatelli
Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine 2022 Druetto A.; Grosso A.
Column generation bounds on a network flow model to minimize the total weighted completion time for a single parallel batching machine 2021 Alessandro Druetto, Andrea Cesare Grosso
Column generation for minimizing total completion time in a parallel-batching environment 2021 Alfieri A.; Druetto A.; Grosso A.; Salassa F.
Column generation for minimizing total completion time on a single machine with parallel batching 2019 Alfieri A.; Druetto A.; Grosso A.; Salassa F.