Croce F. Della

F. Della Croce

Information about the author F. Della Croce will soon be added to the site.
Found 14 papers in total
An exact algorithm for MAX-CUT in sparse graphs
An exact algorithm for MAX-CUT in sparse graphs
2007
We study exact algorithms for the MAX-CUT problem. Introducing a new technique, we...
Scheduling the Italian Football League: an ILP-based approach
Scheduling the Italian Football League: an ILP-based approach
2006
Scheduling the Italian Major Football League (the so-called ‘Serie A’)...
A greedy-based neighborhood search approach to a nurse rostering problem
A greedy-based neighborhood search approach to a nurse rostering problem
2004
A practical nurse rostering problem, which arises at a ward of an Italian hospital, is...
Solving the Hub location problem in telecommunication network design: A local search approach
Solving the Hub location problem in telecommunication network design: A local search approach
2004
This article deals with a Hub Location Problem arising in Telecommunication Network...
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
2004
Based on the work by Congram, Potts and Van de Velde, we develop for the...
Recovering beam search: enhancing the beam search approach for combinatorial optimization problems
Recovering beam search: enhancing the beam search approach for combinatorial optimization problems
2004
A hybrid heuristic method for combinatorial optimization problems is proposed that...
Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem
Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem
2003
We consider the single machine dynamic total completion time scheduling problem. This...
A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
2002
This paper deals with the one-machine dynamic total completion time scheduling...
A heuristic algorithm for the auto-carrier transportation problem
A heuristic algorithm for the auto-carrier transportation problem
2002
The delivery of vehicles to dealers is one of the major tasks in the vehicle...
An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
2002
We consider the two machine total completion time flow shop scheduling problem. This...
A new decomposition approach for the single machine total tardiness scheduling problem
A new decomposition approach for the single machine total tardiness scheduling problem
1998
This paper deals with the single machine total tardiness problem. From Emmons' basic...
The two-machine total completion time flow shop problem
The two-machine total completion time flow shop problem
1996
In this paper we study the NP-hard scheduling problem of minimizing total completion...
Aggregate planning and scheduling in the food industry: A case study
Aggregate planning and scheduling in the food industry: A case study
1995
In this work we introduce a production scheduling problem encountered in COMPAL S.A.,...
Cellular control of manufacturing systems
Cellular control of manufacturing systems
1993
The scope of this paper is twofold. Firstly the authors propose augmented...
Papers per page: