Federico Della Croce
Federico Della Croce
DIGEP Politecnico di Torino, Italy
Verified email at polito.it
TitleCited byYear
A genetic algorithm for the job shop problem
F Della Croce, R Tadei, G Volta
Computers & Operations Research 22 (1), 15-24, 1995
5641995
The two-machine total completion time flow shop problem
F Della Croce, V Narayan, R Tadei
European Journal of Operational Research 90 (2), 227-237, 1996
1451996
A greedy-based neighborhood search approach to a nurse rostering problem
F Bellanti, G Carello, F Della Croce, R Tadei
European Journal of Operational Research 153 (1), 28-40, 2004
1372004
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
A Grosso, F Della Croce, R Tadei
Operations Research Letters 32 (1), 68-72, 2004
1002004
An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
F Della Croce, M Ghirardi, R Tadei
European Journal of Operational Research 139 (2), 293-301, 2002
982002
Scheduling the Italian football league: An ILP-based approach
F Della Croce, D Oliveri
Computers & Operations Research 33 (7), 1963-1974, 2006
912006
Solving the hub location problem in telecommunication network design: A local search approach
G Carello, F Della Croce, M Ghirardi, R Tadei
Networks: An International Journal 44 (2), 94-105, 2004
892004
Solution of the single machine total tardiness problem
W Szwarc, F Della Croce, A Grosso
Journal of Scheduling 2 (2), 55-71, 1999
811999
Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
F Della Croce, M Ghirardi, R Tadei
Journal of Heuristics 10 (1), 89-104, 2004
772004
A recovering beam search algorithm for the one-machine dynamic total completion time scheduling problem
F Della Croce, V T'kindt
Journal of the Operational Research Society 53 (11), 1275-1280, 2002
772002
Algorithmic paradoxes of the single‐machine total tardiness problem
W Szwarc, A Grosso, FD Croce
Journal of Scheduling 4 (2), 93-104, 2001
722001
Fast algorithms for max independent set
N Bourgeois, B Escoffier, VT Paschos, JMM van Rooij
Algorithmica 62 (1-2), 382-415, 2012
602012
Complexity of single machine scheduling problems under scenario-based uncertainty
MA Aloulou, F Della Croce
Operations Research Letters 36 (3), 338-342, 2008
602008
Combining swaps and node weights in an adaptive greedy approach for the maximum clique problem
A Grosso, M Locatelli, F Della Croce
Journal of Heuristics 10 (2), 135-152, 2004
562004
A variable neighborhood search based matheuristic for nurse rostering problems
F Della Croce, F Salassa
Annals of Operations Research 218 (1), 185-199, 2014
552014
Aggregate planning and scheduling in the food industry: A case study
R Tadei, M Trubian, JL Avendano, F Della Croce, G Menga
European Journal of Operational Research 87 (3), 564-573, 1995
531995
Generalized pairwise interchanges and machine scheduling
F Della Croce
European Journal of Operational Research 83 (2), 310-319, 1995
531995
Scheduling a round robin tennis tournamentunder courts and players availability constraints
F Della Croce, R Tadei, PS Asioli
Annals of Operations Research 92, 349-361, 1999
491999
A new decomposition approach for the single machine total tardiness scheduling problem
F Della Croce, R Tadei, P Baracco, A Grosso
Journal of the Operational Research Society 49 (10), 1101-1106, 1998
481998
Minimizing tardy jobs in a flowshop with common due date
F Della Croce, JND Gupta, R Tadei
European Journal of Operational Research 120 (2), 375-381, 2000
472000
The system can't perform the operation now. Try again later.
Articles 1–20