2009 |
24 | EE | Nicolas Bourgeois,
Federico Della Croce,
Bruno Escoffier,
Cécile Murat,
Vangelis Th. Paschos:
Probabilistic graph-coloring in bipartite and split graphs.
J. Comb. Optim. 17(3): 274-311 (2009) |
2008 |
23 | EE | Mohamed Ali Aloulou,
Federico Della Croce:
Complexity of single machine scheduling problems under scenario-based uncertainty.
Oper. Res. Lett. 36(3): 338-342 (2008) |
22 | EE | Federico Della Croce,
Vangelis Th. Paschos:
Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems.
Operational Research 8(3): 235-256 (2008) |
2007 |
21 | EE | Federico Della Croce,
Bruno Escoffier,
Vangelis Th. Paschos:
Improved worst-case complexity for the MIN 3-SET COVERING problem.
Oper. Res. Lett. 35(2): 205-210 (2007) |
20 | EE | Federico Della Croce,
M. J. Kaminski,
Vangelis Th. Paschos:
An exact algorithm for MAX-CUT in sparse graphs.
Oper. Res. Lett. 35(3): 403-408 (2007) |
2006 |
19 | EE | Federico Della Croce,
Dario Oliveri:
Scheduling the Italian Football League: an ILP-based approach.
Computers & OR 33: 1963-1974 (2006) |
18 | EE | Yury Glazkov,
Alexey Baburin,
Edward Gimadi,
Federico Della Croce,
Vangelis Th. Paschos:
Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 2.
Electronic Notes in Discrete Mathematics 27: 35-36 (2006) |
17 | EE | Giuliana Carello,
Federico Della Croce,
Andrea Grosso,
Marco Locatelli:
A "maximum node clustering" problem.
J. Comb. Optim. 11(4): 373-385 (2006) |
2005 |
16 | EE | Federico Della Croce,
Bruno Escoffier,
Cécile Murat,
Vangelis Th. Paschos:
Probabilistic Coloring of Bipartite and Split Graphs.
ICCSA (4) 2005: 202-211 |
15 | EE | Federico Della Croce,
Vangelis Th. Paschos:
Computing Optimal Solutions for the min 3-set covering Problem.
ISAAC 2005: 685-692 |
2004 |
14 | EE | F. Bellanti,
Giuliana Carello,
Federico Della Croce,
Roberto Tadei:
A greedy-based neighborhood search approach to a nurse rostering problem.
European Journal of Operational Research 153(1): 28-40 (2004) |
13 | EE | Federico Della Croce,
Marco Ghirardi,
Roberto Tadei:
Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems.
J. Heuristics 10(1): 89-104 (2004) |
12 | EE | Andrea Grosso,
Marco Locatelli,
Federico Della Croce:
Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem.
J. Heuristics 10(2): 135-152 (2004) |
11 | EE | Federico Della Croce,
Andrea Grosso,
Vangelis Th. Paschos:
Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem.
J. Scheduling 7(1): 85-91 (2004) |
10 | EE | Vincent T'Kindt,
Federico Della Croce,
Carl Esswein:
Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems.
J. Scheduling 7(6): 429-440 (2004) |
9 | EE | Luigi De Giovanni,
Federico Della Croce,
Roberto Tadei:
On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints.
Networks 44(2): 73-83 (2004) |
8 | EE | Giuliana Carello,
Federico Della Croce,
Marco Ghirardi,
Roberto Tadei:
Solving the Hub location problem in telecommunication network design: A local search approach.
Networks 44(2): 94-105 (2004) |
7 | EE | Andrea Grosso,
Federico Della Croce,
Roberto Tadei:
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem.
Oper. Res. Lett. 32(1): 68-72 (2004) |
2003 |
6 | EE | Federico Della Croce,
Vincent T'Kindt:
Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
Oper. Res. Lett. 31(2): 142-148 (2003) |
2002 |
5 | | Roberto Tadei,
Andrea Grosso,
Federico Della Croce:
Finding the Pareto-optima for the total and maximum tardiness single machine problem.
Discrete Applied Mathematics 124(1-3): 117-126 (2002) |
1999 |
4 | EE | Federico Della Croce,
Vangelis Th. Paschos,
Alexis Tsoukiàs:
An improved general procedure for lexicographic bottleneck problems.
Oper. Res. Lett. 24(4): 187-194 (1999) |
1995 |
3 | EE | Federico Della Croce,
Roberto Tadei,
Giuseppe Volta:
A genetic algorithm for the job shop problem.
Computers & OR 22(1): 15-24 (1995) |
1994 |
2 | | Giuseppe Menga,
Roberto Tadei,
M. Trubian,
Giuseppe Volta,
Federico Della Croce:
Production Scheduling for Perishable Goods: A Case Study.
ICRA 1994: 507-512 |
1993 |
1 | | Federico Della Croce,
Roberto Tadei,
Paolo Baracco,
Raffaele Di Tullio:
On Minimizing the Weighted Sum Of Quadratic Completion Times on a Single Machine.
ICRA (3) 1993: 816-820 |