The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Federico Della Croce: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos
    Probabilistic Coloring of Bipartite and Split Graphs. [Citation Graph (0, 0)][DBLP]
    ICCSA (4), 2005, pp:202-211 [Conf]
  2. Federico Della Croce, Roberto Tadei, Paolo Baracco, Raffaele Di Tullio
    On Minimizing the Weighted Sum Of Quadratic Completion Times on a Single Machine. [Citation Graph (0, 0)][DBLP]
    ICRA (3), 1993, pp:816-820 [Conf]
  3. Giuseppe Menga, Roberto Tadei, M. Trubian, Giuseppe Volta, Federico Della Croce
    Production Scheduling for Perishable Goods: A Case Study. [Citation Graph (0, 0)][DBLP]
    ICRA, 1994, pp:507-512 [Conf]
  4. Federico Della Croce, Vangelis Th. Paschos
    Computing Optimal Solutions for the min 3-set covering Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:685-692 [Conf]
  5. Federico Della Croce, Dario Oliveri
    Scheduling the Italian Football League: an ILP-based approach. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:, pp:1963-1974 [Journal]
  6. Federico Della Croce, Roberto Tadei, Giuseppe Volta
    A genetic algorithm for the job shop problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1995, v:22, n:1, pp:15-24 [Journal]
  7. Roberto Tadei, Andrea Grosso, Federico Della Croce
    Finding the Pareto-optima for the total and maximum tardiness single machine problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:124, n:1-3, pp:117-126 [Journal]
  8. Andrea Grosso, Marco Locatelli, Federico Della Croce
    Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2004, v:10, n:2, pp:135-152 [Journal]
  9. Federico Della Croce, Marco Ghirardi, Roberto Tadei
    Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2004, v:10, n:1, pp:89-104 [Journal]
  10. Giuliana Carello, Federico Della Croce, Andrea Grosso, Marco Locatelli
    A "maximum node clustering" problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2006, v:11, n:4, pp:373-385 [Journal]
  11. Giuliana Carello, Federico Della Croce, Marco Ghirardi, Roberto Tadei
    Solving the Hub location problem in telecommunication network design: A local search approach. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:44, n:2, pp:94-105 [Journal]
  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. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:44, n:2, pp:73-83 [Journal]
  13. Federico Della Croce, Vangelis Th. Paschos, Alexis Tsoukiàs
    An improved general procedure for lexicographic bottleneck problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:24, n:4, pp:187-194 [Journal]
  14. Federico Della Croce, Vincent T'Kindt
    Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:2, pp:142-148 [Journal]
  15. Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos
    Improved worst-case complexity for the MIN 3-SET COVERING problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:2, pp:205-210 [Journal]
  16. Vincent T'Kindt, Federico Della Croce, Carl Esswein
    Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2004, v:7, n:6, pp:429-440 [Journal]
  17. Federico Della Croce, Andrea Grosso, Vangelis Th. Paschos
    Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2004, v:7, n:1, pp:85-91 [Journal]

  18. Exact Algorithms for Dominating Clique Problems. [Citation Graph (, )][DBLP]


  19. A heuristic approach for the max-min diversity problem based on max-clique. [Citation Graph (, )][DBLP]


  20. Computational experience with a core-based reduction procedure for the 2-knapsack problem. [Citation Graph (, )][DBLP]


  21. Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002