Croce Federico Della

Federico Della Croce

Information about the author Federico Della Croce will soon be added to the site.
Found 16 papers in total
Discrete‐time, economic lot scheduling problem on multiple, non‐identical production lines
Discrete‐time, economic lot scheduling problem on multiple, non‐identical production lines
2011
This paper deals with a general discrete time dynamic demand model to solve real time...
Approximating the metric 2-peripatetic salesman problem
Approximating the metric 2-peripatetic salesman problem
2010
This paper deals with the 2-Peripatetic Salesman Problem for the case where costs...
Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria
Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria
2007
We consider a two–machine flowshop–scheduling problem with an unknown...
Improved worst-case complexity for the MIN 3-SET COVERING problem
Improved worst-case complexity for the MIN 3-SET COVERING problem
2007
We consider MIN SET COVERING when the subsets are constrained to have maximum...
Revisiting branch and bound search strategies for machine scheduling problems
Revisiting branch and bound search strategies for machine scheduling problems
2004
In the design of exact methods for NP-hard machine scheduling problems, branch and...
Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
2004
The weakly NP-hard single-machine total tardiness scheduling problem has been...
A ‘maximum node clustering’ problem
A ‘maximum node clustering’ problem
2006
In this note we introduce a graph problem, called Maximum Node Clustering (MNC). We...
Algorithmic paradoxes of the single-machine total tardiness problem
Algorithmic paradoxes of the single-machine total tardiness problem
2001
The paper deals with the single-machine total tardiness problem. It investigates the...
An improved general procedure for lexicographic bottleneck problems
An improved general procedure for lexicographic bottleneck problems
1999
In combinatorial optimization, the bottleneck (or minmax) problems are those problems...
Scheduling a round robin tennis tournament under courts and players availability constraints
Scheduling a round robin tennis tournament under courts and players availability constraints
1999
A practical problem encountered by the management of a tennis club is the organization...
Solution of the single machine total tardiness problem
Solution of the single machine total tardiness problem
1999
The paper deals with the solution of the single machine total tardiness model. It...
Minimizing tardy jobs in a flowshop with common due date
Minimizing tardy jobs in a flowshop with common due date
2000
This paper considers the two-machine flowshop scheduling problem where the total time...
Some thoughts on combinatorial optimisation
Some thoughts on combinatorial optimisation
1995
A group of young researchers from the ESI X summer school, HEC, Jouy-en-Josas 1994,...
Generalized pairwise interchanges and machine scheduling
Generalized pairwise interchanges and machine scheduling
1995
In this paper a generalization of pairwise interchanges is considered and applied to...
A multi-KP modeling for the maximum-clique problem
A multi-KP modeling for the maximum-clique problem
1994
In this paper the problem of finding the maximum clique of an arbitrary graph G=(X,A)...
A genetic algorithm for the job shop problem
A genetic algorithm for the job shop problem
1995
In this paper the authors introduce a genetic algorithm whose peculiarities are the...
Papers per page: