Federico Della Croce

According to our database, Federico Della Croce authored at least 100 papers between 1992 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

ITERATED INSIDE OUT: a new exact algorithm for the transportation problem.

Roberto Bargetto, Federico Della Croce, Rosario Scatamacchia

CoRR, 2023

2022

Exact solution of the two-machine flow shop problem with three operations.

Federico Della Croce, Fabio Salassa, Vincent T'kindt

Comput. Oper. Res., 2022

Improved solution of the Budget constrained Fuel Treatment Scheduling problem and extensions.

Federico Della Croce, Marco Ghirardi, Rosario Scatamacchia

Comput. Ind. Eng., 2022

On fairness and diversification in WTA and ATP tennis tournaments generation.

Federico Della Croce, Gabriele Dragotto, Rosario Scatamacchia

Ann. Oper. Res., 2022

Moderate exponential-time algorithms for scheduling problems.

Vincent T'kindt, Federico Della Croce, Mathieu Liedloff

4OR, 2022

2021

Minimizing total completion time in the two-machine no-idle no-wait flow shop problem.

Federico Della Croce, Andrea Grosso, Fabio Salassa

J. Heuristics, 2021

<i>Branch</i> & <i>Memorize</i> exact algorithms for sequencing problems: Efficient embedding of memorization into search trees.

Lei Shang, Vincent T'kindt, Federico Della Croce

Comput. Oper. Res., 2021

Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs.

Jully Jeunet, Federico Della Croce, Fabio Salassa

Comput. Oper. Res., 2021

Parallel machine scheduling with minimum number of tardy jobs: Approximation and exponential algorithms.

Federico Della Croce, Vincent T'kindt, Olivier Ploton

Appl. Math. Comput., 2021

Merging combinatorial design and optimization: the Oberwolfach problem.

Fabio Salassa, Gabriele Dragotto, Tommaso Traetta, Marco Buratti, Federico Della Croce

Australas. J Comb., 2021

2020

The Longest Processing Time rule for identical parallel machines revisited.

Federico Della Croce, Rosario Scatamacchia

J. Sched., 2020

An exact approach for the bilevel knapsack problem with interdiction constraints and extensions.

Federico Della Croce, Rosario Scatamacchia

Math. Program., 2020

Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights.

Vincent T'kindt, Lei Shang, Federico Della Croce

J. Comb. Optim., 2020

An improved solution approach for the Budget constrained Fuel Treatment Scheduling problem.

Federico Della Croce, Marco Ghirardi, Rosario Scatamacchia

CoRR, 2020

An enhanced pinwheel algorithm for the bamboo garden trimming problem.

Federico Della Croce

CoRR, 2020

2019

No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths.

Jean-Charles Billaut, Federico Della Croce, Fabio Salassa, Vincent T'kindt

J. Sched., 2019

A tight linear time $$\frac{13}{12}$$ -approximation algorithm for the $$P2 || C_{\max }$$ problem.

Federico Della Croce, Rosario Scatamacchia, Vincent T'kindt

J. Comb. Optim., 2019

On approximating the Incremental Knapsack Problem.

Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia

Discret. Appl. Math., 2019

New exact approaches and approximation results for the Penalized Knapsack Problem.

Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia

Discret. Appl. Math., 2019

Lower Bounds and a New Exact Approach for the Bilevel Knapsack with Interdiction Constraints.

Federico Della Croce, Rosario Scatamacchia

Proceedings of the Integer Programming and Combinatorial Optimization, 2019

Improved Approximation Bounds Via Problem Independent Linear Programming Modeling.

Federico Della Croce

Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, 2019

2018

An exact exponential branch-and-merge algorithm for the single machine total tardiness problem.

Michele Garraffa, Lei Shang, Federico Della Croce, Vincent T'kindt

Theor. Comput. Sci., 2018

Approximating the 3-period Incremental Knapsack Problem.

Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia

J. Discrete Algorithms, 2018

A new exact approach for the Bilevel Knapsack with Interdiction Constraints.

Federico Della Croce, Rosario Scatamacchia

CoRR, 2018

2017

An exact semidefinite programming approach for the max-mean dispersion problem.

Michele Garraffa, Federico Della Croce, Fabio Salassa

J. Comb. Optim., 2017

Minimizing the number of tardy jobs in two-machine settings with common due date.

Federico Della Croce, Christos Koulamas, Vincent T'kindt

J. Comb. Optim., 2017

A new exact approach for the 0-1 Collapsing Knapsack Problem.

Federico Della Croce, Fabio Salassa, Rosario Scatamacchia

Eur. J. Oper. Res., 2017

A constraint generation approach for two-machine shop problems with jobs selection.

Federico Della Croce, Christos Koulamas, Vincent T'kindt

Eur. J. Oper. Res., 2017

MILP and Max-Clique based heuristics for the Eternity II puzzle.

Fabio Salassa, Wim Vancroonenburg, Tony Wauters, Federico Della Croce, Greet Vanden Berghe

CoRR, 2017

Dynamic programming algorithms, efficient solution of the LP-relaxation and approximation schemes for the Penalized Knapsack Problem.

Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia

CoRR, 2017

No-idle, no-wait: when shop scheduling meets dominoes, eulerian and hamiltonian paths.

Jean-Charles Billaut, Federico Della Croce, Fabio Salassa, Vincent T'kindt

CoRR, 2017

An exact approach for the 0-1 knapsack problem with setups.

Federico Della Croce, Fabio Salassa, Rosario Scatamacchia

Comput. Oper. Res., 2017

Heuristic approaches for a domestic energy management system.

Federico Della Croce, Michele Garraffa, Fabio Salassa, Claudio Borean, Giuseppe Di Bella, Ennio Grasso

Comput. Ind. Eng., 2017

Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem.

Lei Shang, Michele Garraffa, Federico Della Croce, Vincent T'kindt

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

Approximation Results for the Incremental Knapsack Problem.

Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

2016

MP or not MP: that is the question.

Federico Della Croce

J. Sched., 2016

A hybrid three-phase approach for the Max-Mean Dispersion Problem.

Federico Della Croce, Michele Garraffa, Fabio Salassa

Comput. Oper. Res., 2016

2015

Erratum - One Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons.

John J. Kanet, Federico Della Croce, Christos Koulamas, Vincent T'kindt

Oper. Res., 2015

A single machine scheduling problem with two-dimensional vector packing constraints.

Jean-Charles Billaut, Federico Della Croce, Andrea Grosso

Eur. J. Oper. Res., 2015

On the max min vertex cover problem.

Nicolas Boria, Federico Della Croce, Vangelis Th. Paschos

Discret. Appl. Math., 2015

2014

Reoptimization in machine scheduling.

Nicolas Boria, Federico Della Croce

Theor. Comput. Sci., 2014

Efficient algorithms for the max k-vertex cover problem.

Federico Della Croce, Vangelis Th. Paschos

J. Comb. Optim., 2014

The Red-Blue transportation problem.

Wim Vancroonenburg, Federico Della Croce, Dries R. Goossens, Frits C. R. Spieksma

Eur. J. Oper. Res., 2014

A hybrid heuristic approach for single machine scheduling with release times.

Federico Della Croce, Fabio Salassa, Vincent T'kindt

Comput. Oper. Res., 2014

The Selective Fixing Algorithm for the closest string problem.

Federico Della Croce, Michele Garraffa

Comput. Oper. Res., 2014

A variable neighborhood search based matheuristic for nurse rostering problems.

Federico Della Croce, Fabio Salassa

Ann. Oper. Res., 2014

A matheuristic approach for the two-machine total completion time flow shop problem.

Federico Della Croce, Andrea Grosso, Fabio Salassa

Ann. Oper. Res., 2014

A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection.

Federico Della Croce, Christos Koulamas, Vincent T'kindt

Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem.

Federico Della Croce, Michele Garraffa, Fabio Salassa

Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013

Fast algorithms for min independent dominating set.

Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos

Discret. Appl. Math., 2013

2012

Algorithms for dominating clique problems.

Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos

Theor. Comput. Sci., 2012

Improving an exact approach for solving separable integer quadratic knapsack problems.

Federico Della Croce, Dominique Quadri

J. Comb. Optim., 2012

A note on minimizing the sum of quadratic completion times on two identical parallel machines.

Federico Della Croce, Christos Koulamas

Inf. Process. Lett., 2012

A note on "Two-machine flow-shop scheduling with rejection" and its link with flow-shop scheduling and common due date assignment.

Vincent T'kindt, Federico Della Croce

Comput. Oper. Res., 2012

Improved LP-based algorithms for the closest string problem.

Federico Della Croce, Fabio Salassa

Comput. Oper. Res., 2012

Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem.

Federico Della Croce, Thierry Garaix, Andrea Grosso

Comput. Oper. Res., 2012

Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem.

Federico Della Croce, Andrea Grosso

Comput. Oper. Res., 2012

2011

Discrete-time, economic lot scheduling problem on multiple, non-identical production lines.

Ramesh Bollapragada, Federico Della Croce, Marco Ghirardi

Eur. J. Oper. Res., 2011

Computational experience with a core-based reduction procedure for the 2-knapsack problem.

Federico Della Croce, Andrea Grosso

Comput. Oper. Res., 2011

A note on "Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time".

Federico Della Croce, E. Desmier, Thierry Garaix

Comput. Ind. Eng., 2011

A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem.

Federico Della Croce, Andrea Grosso, Fabio Salassa

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2011

2010

Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances.

Philippe Baptiste, Federico Della Croce, Andrea Grosso, Vincent T'kindt

J. Sched., 2010

Improving the preemptive bound for the single machine dynamic maximum lateness problem.

Federico Della Croce, Vincent T'kindt

Oper. Res. Lett., 2010

Approximating the metric 2-Peripatetic Salesman Problem.

Federico Della Croce, Vangelis Th. Paschos, Roberto Wolfler Calvo

Algorithmic Oper. Res., 2010

2009

Probabilistic graph-coloring in bipartite and split graphs.

Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos

J. Comb. Optim., 2009

Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2.

Alexey Baburin, Federico Della Croce, Edward Gimadi, Y. V. Glazkov, Vangelis Th. Paschos

Discret. Appl. Math., 2009

A heuristic approach for the max-min diversity problem based on max-clique.

Federico Della Croce, Andrea Grosso, Marco Locatelli

Comput. Oper. Res., 2009

Exact Algorithms for Dominating Clique Problems.

Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Complexity of single machine scheduling problems under scenario-based uncertainty.

Mohamed Ali Aloulou, Federico Della Croce

Oper. Res. Lett., 2008

Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems.

Federico Della Croce, Vangelis Th. Paschos

Oper. Res., 2008

2007

An exact algorithm for MAX-CUT in sparse graphs.

Federico Della Croce, Marcin Jakub Kaminski, Vangelis Th. Paschos

Oper. Res. Lett., 2007

Improved worst-case complexity for the MIN 3-SET COVERING problem.

Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos

Oper. Res. Lett., 2007

Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria.

Vincent T'kindt, Federico Della Croce, Jean-Louis Bouquard

INFORMS J. Comput., 2007

2006

A "maximum node clustering" problem.

Giuliana Carello, Federico Della Croce, Andrea Grosso, Marco Locatelli

J. Comb. Optim., 2006

Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 2.

Yury Glazkov, Alexey Baburin, Edward Gimadi, Federico Della Croce, Vangelis Th. Paschos

Electron. Notes Discret. Math., 2006

Scheduling the Italian Football League: an ILP-based approach.

Federico Della Croce, Dario Oliveri

Comput. Oper. Res., 2006

2005

Computing Optimal Solutions for the min 3-set covering Problem.

Federico Della Croce, Vangelis Th. Paschos

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Probabilistic Coloring of Bipartite and Split Graphs.

Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos

Proceedings of the Computational Science and Its Applications, 2005

2004

Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems.

Vincent T'kindt, Federico Della Croce, Carl Esswein

J. Sched., 2004

Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem.

Federico Della Croce, Andrea Grosso, Vangelis Th. Paschos

J. Sched., 2004

An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem.

Andrea Grosso, Federico Della Croce, Roberto Tadei

Oper. Res. Lett., 2004

On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints.

Luigi De Giovanni, Federico Della Croce, Roberto Tadei

Networks, 2004

Solving the Hub location problem in telecommunication network design: A local search approach.

Giuliana Carello, Federico Della Croce, Marco Ghirardi, Roberto Tadei

Networks, 2004

Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem.

Andrea Grosso, Marco Locatelli, Federico Della Croce

J. Heuristics, 2004

Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems.

Federico Della Croce, Marco Ghirardi, Roberto Tadei

J. Heuristics, 2004

A greedy-based neighborhood search approach to a nurse rostering problem.

F. Bellanti, Giuliana Carello, Federico Della Croce, Roberto Tadei

Eur. J. Oper. Res., 2004

2003

Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.

Federico Della Croce, Vincent T'kindt

Oper. Res. Lett., 2003

2002

A Heuristic Algorithm for the Auto-Carrier Transportation Problem.

Roberto Tadei, Guido Perboli, Federico Della Croce

Transp. Sci., 2002

A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem.

Federico Della Croce, Vincent T'kindt

J. Oper. Res. Soc., 2002

An improved branch-and-bound algorithm for the two machine total completion time flow shop problem.

Federico Della Croce, Marco Ghirardi, Roberto Tadei

Eur. J. Oper. Res., 2002

Finding the Pareto-optima for the total and maximum tardiness single machine problem.

Roberto Tadei, Andrea Grosso, Federico Della Croce

Discret. Appl. Math., 2002

2000

Minimizing tardy jobs in a flowshop with common due date.

Federico Della Croce, Jatinder N. D. Gupta, Roberto Tadei

Eur. J. Oper. Res., 2000

1999

An improved general procedure for lexicographic bottleneck problems.

Federico Della Croce, Vangelis Th. Paschos, Alexis Tsoukiàs

Oper. Res. Lett., 1999

Scheduling a round robin tennis tournamentunder courts and players availability constraints.

Federico Della Croce, Roberto Tadei, P. S. Asioli

Ann. Oper. Res., 1999

1998

Minimising makespan in the two-machine flow-shop with release times.

Roberto Tadei, Jatinder N. D. Gupta, Federico Della Croce, M. Cortesi

J. Oper. Res. Soc., 1998

A new decomposition approach for the single machine total tardiness scheduling problem.

Federico Della Croce, Roberto Tadei, Paolo Baracco, Andrea Grosso

J. Oper. Res. Soc., 1998

1995

A genetic algorithm for the job shop problem.

Federico Della Croce, Roberto Tadei, Giuseppe Volta

Comput. Oper. Res., 1995

1994

Production Scheduling for Perishable Goods: A Case Study.

Giuseppe Menga, Roberto Tadei, M. Trubian, Giuseppe Volta, Federico Della Croce

Proceedings of the 1994 International Conference on Robotics and Automation, 1994

1993

On Minimizing the Weighted Sum Of Quadratic Completion Times on a Single Machine.

Federico Della Croce, Roberto Tadei, Paolo Baracco, Raffaele Di Tullio

Proceedings of the 1993 IEEE International Conference on Robotics and Automation, 1993

1992

Cellular control of flexible manufacturing systems.

Federico Della Croce, Giuseppe Menga, Roberto Tadei, M. Cavalotto, L. Petri

Proceedings of the 1992 IEEE International Conference on Robotics and Automation, 1992