![]() | ![]() |
| 2012 | ||
|---|---|---|
| 42 | Federico Della Croce, Andrea Grosso: Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem. Computers & OR 39(1): 27-31 (2012) | |
| 41 | Federico Della Croce, Fabio Salassa: Improved LP-based algorithms for the closest string problem. Computers & OR 39(3): 746-749 (2012) | |
| 40 | Federico Della Croce, Thierry Garaix, Andrea Grosso: Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem. Computers & OR 39(6): 1213-1217 (2012) | |
| 39 | Federico Della Croce, Dominique Quadri: Improving an exact approach for solving separable integer quadratic knapsack problems. J. Comb. Optim. 23(1): 21-28 (2012) | |
| 2011 | ||
| 38 | Federico Della Croce, Andrea Grosso, Fabio Salassa: A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem. EvoCOP 2011: 38-47 | |
| 37 | Federico Della Croce, E. Desmier, Thierry Garaix: A note on "Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time". Computers & Industrial Engineering 60(1): 183-186 (2011) | |
| 36 | Federico Della Croce, Andrea Grosso: Computational experience with a core-based reduction procedure for the 2-knapsack problem. Computers & OR 38(2): 514-516 (2011) | |
| 35 | Ramesh Bollapragada, Federico Della Croce, Marco Ghirardi: Discrete-time, economic lot scheduling problem on multiple, non-identical production lines. European Journal of Operational Research 215(1): 89-96 (2011) | |
| 2010 | ||
| 34 | Federico Della Croce, Vangelis Th. Paschos, Roberto Wolfler Calvo: Approximating the metric 2-Peripatetic Salesman Problem. Algorithmic Operations Research 5(1): 13-20 (2010) | |
| 33 | P. Baptiste, Federico Della Croce, Andrea Grosso, Vincent T'Kindt: Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances. J. Scheduling 13(1): 39-47 (2010) | |
| 32 | Federico Della Croce, Vincent T'Kindt: Improving the preemptive bound for the single machine dynamic maximum lateness problem. Oper. Res. Lett. 38(6): 589-591 (2010) | |
| 2009 | ||
| 31 | Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos: Exact Algorithms for Dominating Clique Problems. ISAAC 2009: 4-13 | |
| 30 | Federico Della Croce, Andrea Grosso, Marco Locatelli: A heuristic approach for the max-min diversity problem based on max-clique. Computers & OR 36(8): 2429-2433 (2009) | |
| 29 | Alexey Baburin, Federico Della Croce, Edward Gimadi, Y. V. Glazkov, Vangelis Th. Paschos: Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2. Discrete Applied Mathematics 157(9): 1988-1992 (2009) | |
| 28 | 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 | ||
| 27 | Mohamed Ali Aloulou, Federico Della Croce: Complexity of single machine scheduling problems under scenario-based uncertainty. Oper. Res. Lett. 36(3): 338-342 (2008) | |
| 26 | 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 | ||
| 25 | Vincent T'Kindt, Federico Della Croce, Jean-Louis Bouquard: Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria. INFORMS Journal on Computing 19(1): 64-72 (2007) | |
| 24 | 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) | |
| 23 | Federico Della Croce, Marcin Jakub Kaminski, Vangelis Th. Paschos: An exact algorithm for MAX-CUT in sparse graphs. Oper. Res. Lett. 35(3): 403-408 (2007) | |
| 2006 | ||
| 22 | Federico Della Croce, Dario Oliveri: Scheduling the Italian Football League: an ILP-based approach. Computers & OR 33: 1963-1974 (2006) | |
| 21 | 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) | |
| 20 | Giuliana Carello, Federico Della Croce, Andrea Grosso, Marco Locatelli: A "maximum node clustering" problem. J. Comb. Optim. 11(4): 373-385 (2006) | |
| 2005 | ||
| 19 | Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos: Probabilistic Coloring of Bipartite and Split Graphs. ICCSA (4) 2005: 202-211 | |
| 18 | Federico Della Croce, Vangelis Th. Paschos: Computing Optimal Solutions for the min 3-set covering Problem. ISAAC 2005: 685-692 | |
| 2004 | ||
| 17 | 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) | |
| 16 | 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) | |
| 15 | 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) | |
| 14 | 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) | |
| 13 | 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) | |
| 12 | 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) | |
| 11 | 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) | |
| 10 | 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 | ||
| 9 | 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 | ||
| 8 | 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) | |
| 7 | Federico Della Croce, Marco Ghirardi, Roberto Tadei: An improved branch-and-bound algorithm for the two machine total completion time flow shop problem. European Journal of Operational Research 139(2): 293-301 (2002) | |
| 6 | Roberto Tadei, Guido Perboli, Federico Della Croce: A Heuristic Algorithm for the Auto-Carrier Transportation Problem. Transportation Science 36(1): 55-62 (2002) | |
| 2000 | ||
| 5 | Federico Della Croce, Jatinder N. D. Gupta, Roberto Tadei: Minimizing tardy jobs in a flowshop with common due date. European Journal of Operational Research 120(2): 375-381 (2000) | |
| 1999 | ||
| 4 | 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 | 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 | |
Colors in the list of coauthors
Last update Tue May 29 01:28:40 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page