Federico Della Croce

107 papers A* 2B 6C 4Journal 92Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
Iterated Inside Out: A New Exact Algorithm for the Transportation Problem.
INFORMS J. Comput.
Roberto Bargetto, Federico Della Croce, Rosario Scatamacchia
2024 J jnl
Moderate exponential-time algorithms for scheduling problems.
Ann. Oper. Res.
Vincent T'kindt, Federico Della Croce, Mathieu Liedloff
2024 J jnl
Single machine adversarial bilevel scheduling problems.
Eur. J. Oper. Res.
Vincent T'kindt, Federico Della Croce, Alessandro Agnetis
2023 J jnl
ITERATED INSIDE OUT: a new exact algorithm for the transportation problem.
CoRR
Roberto Bargetto, Federico Della Croce, Rosario Scatamacchia
2022 J jnl
Exact solution of the two-machine flow shop problem with three operations.
Comput. Oper. Res.
Federico Della Croce, Fabio Salassa, Vincent T'kindt
2022 J jnl
Improved solution of the Budget constrained Fuel Treatment Scheduling problem and extensions.
Comput. Ind. Eng.
Federico Della Croce, Marco Ghirardi, Rosario Scatamacchia
2022 J jnl
Moderate exponential-time algorithms for scheduling problems.
4OR
Vincent T'kindt, Federico Della Croce, Mathieu Liedloff
2022 J jnl
On fairness and diversification in WTA and ATP tennis tournaments generation.
Ann. Oper. Res.
Federico Della Croce, Gabriele Dragotto, Rosario Scatamacchia
2021 J jnl
Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs.
Comput. Oper. Res.
Jully Jeunet, Federico Della Croce, Fabio Salassa
2021 J jnl
Merging combinatorial design and optimization: the Oberwolfach problem.
Australas. J Comb.
Fabio Salassa, Gabriele Dragotto, Tommaso Traetta, Marco Buratti, Federico Della Croce
2021 J jnl
Minimizing total completion time in the two-machine no-idle no-wait flow shop problem.
J. Heuristics
Federico Della Croce, Andrea Grosso, Fabio Salassa
2021 J jnl
Parallel machine scheduling with minimum number of tardy jobs: Approximation and exponential algorithms.
Appl. Math. Comput.
Federico Della Croce, Vincent T'kindt, Olivier Ploton
2020 J jnl
An enhanced pinwheel algorithm for the bamboo garden trimming problem.
CoRR
Federico Della Croce
2020 J jnl
An exact approach for the bilevel knapsack problem with interdiction constraints and extensions.
Math. Program.
Federico Della Croce, Rosario Scatamacchia
2020 J jnl
An improved solution approach for the Budget constrained Fuel Treatment Scheduling problem.
CoRR
Federico Della Croce, Marco Ghirardi, Rosario Scatamacchia
2020 J jnl
Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights.
J. Comb. Optim.
Vincent T'kindt, Lei Shang, Federico Della Croce
2020 J jnl
The Longest Processing Time rule for identical parallel machines revisited.
J. Sched.
Federico Della Croce, Rosario Scatamacchia
2019 J jnl
A tight linear time $$\frac{13}{12}$$ -approximation algorithm for the $$P2 || C_{\max }$$ problem.
J. Comb. Optim.
Federico Della Croce, Rosario Scatamacchia, Vincent T'kindt
2019 C conf
Improved Approximation Bounds Via Problem Independent Linear Programming Modeling.
ICORES
Federico Della Croce
2019 B conf
Lower Bounds and a New Exact Approach for the Bilevel Knapsack with Interdiction Constraints.
IPCO
Federico Della Croce, Rosario Scatamacchia
2019 J jnl
New exact approaches and approximation results for the Penalized Knapsack Problem.
Discret. Appl. Math.
Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
2019 J jnl
No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths.
J. Sched.
Jean-Charles Billaut, Federico Della Croce, Fabio Salassa, Vincent T'kindt
2019 J jnl
On approximating the Incremental Knapsack Problem.
Discret. Appl. Math.
Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
2018 J jnl
A new exact approach for the Bilevel Knapsack with Interdiction Constraints.
CoRR
Federico Della Croce, Rosario Scatamacchia
2018 J jnl
An exact exponential branch-and-merge algorithm for the single machine total tardiness problem.
Theor. Comput. Sci.
Michele Garraffa, Lei Shang, Federico Della Croce, Vincent T'kindt
2018 J jnl
Approximating the 3-period Incremental Knapsack Problem.
J. Discrete Algorithms
Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
2018 J jnl
Approximating the Incremental Knapsack Problem.
CoRR
Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
2018 J jnl
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem.
CoRR
Federico Della Croce, Thierry Garaix, Andrea Grosso
2018 J jnl
Longest Processing Time rule for identical parallel machines revisited.
CoRR
Federico Della Croce, Rosario Scatamacchia
2017 J jnl
A constraint generation approach for two-machine shop problems with jobs selection.
Eur. J. Oper. Res.
Federico Della Croce, Christos Koulamas, Vincent T'kindt
2017 J jnl
A new exact approach for the 0-1 Collapsing Knapsack Problem.
Eur. J. Oper. Res.
Federico Della Croce, Fabio Salassa, Rosario Scatamacchia
2017 J jnl
An exact approach for the 0-1 knapsack problem with setups.
Comput. Oper. Res.
Federico Della Croce, Fabio Salassa, Rosario Scatamacchia
2017 J jnl
An exact semidefinite programming approach for the max-mean dispersion problem.
J. Comb. Optim.
Michele Garraffa, Federico Della Croce, Fabio Salassa
2017 C conf
Approximation Results for the Incremental Knapsack Problem.
IWOCA
Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
2017 J jnl
Dynamic programming algorithms, efficient solution of the LP-relaxation and approximation schemes for the Penalized Knapsack Problem.
CoRR
Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
2017 J jnl
Heuristic approaches for a domestic energy management system.
Comput. Ind. Eng.
Federico Della Croce, Michele Garraffa, Fabio Salassa, Claudio Borean, Giuseppe Di Bella, Ennio Grasso
2017 J jnl
MILP and Max-Clique based heuristics for the Eternity II puzzle.
CoRR
Fabio Salassa, Wim Vancroonenburg, Tony Wauters, Federico Della Croce, Greet Vanden Berghe
2017 B conf
Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem.
IPEC
Lei Shang, Michele Garraffa, Federico Della Croce, Vincent T'kindt
2017 J jnl
Minimizing the number of tardy jobs in two-machine settings with common due date.
J. Comb. Optim.
Federico Della Croce, Christos Koulamas, Vincent T'kindt
2017 J jnl
No-idle, no-wait: when shop scheduling meets dominoes, eulerian and hamiltonian paths.
CoRR
Jean-Charles Billaut, Federico Della Croce, Fabio Salassa, Vincent T'kindt
2016 J jnl
A hybrid three-phase approach for the Max-Mean Dispersion Problem.
Comput. Oper. Res.
Federico Della Croce, Michele Garraffa, Fabio Salassa
2016 J jnl
MP or not MP: that is the question.
J. Sched.
Federico Della Croce
2015 J jnl
A single machine scheduling problem with two-dimensional vector packing constraints.
Eur. J. Oper. Res.
Jean-Charles Billaut, Federico Della Croce, Andrea Grosso
2015 J jnl
Erratum - One Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons.
Oper. Res.
John J. Kanet, Federico Della Croce, Christos Koulamas, Vincent T'kindt
2015 J jnl
On the max min vertex cover problem.
Discret. Appl. Math.
Nicolas Boria, Federico Della Croce, Vangelis Th. Paschos
2014 C conf
A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection.
ISCO
Federico Della Croce, Christos Koulamas, Vincent T'kindt
2014 C conf
A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem.
ISCO
Federico Della Croce, Michele Garraffa, Fabio Salassa
2014 J jnl
A hybrid heuristic approach for single machine scheduling with release times.
Comput. Oper. Res.
Federico Della Croce, Fabio Salassa, Vincent T'kindt
2014 J jnl
A matheuristic approach for the two-machine total completion time flow shop problem.
Ann. Oper. Res.
Federico Della Croce, Andrea Grosso, Fabio Salassa
2014 J jnl
A variable neighborhood search based matheuristic for nurse rostering problems.
Ann. Oper. Res.
Federico Della Croce, Fabio Salassa
2014 J jnl
Efficient algorithms for the max k-vertex cover problem.
J. Comb. Optim.
Federico Della Croce, Vangelis Th. Paschos
2014 J jnl
Reoptimization in machine scheduling.
Theor. Comput. Sci.
Nicolas Boria, Federico Della Croce
2014 J jnl
The Red-Blue transportation problem.
Eur. J. Oper. Res.
Wim Vancroonenburg, Federico Della Croce, Dries R. Goossens, Frits C. R. Spieksma
2014 J jnl
The Selective Fixing Algorithm for the closest string problem.
Comput. Oper. Res.
Federico Della Croce, Michele Garraffa
2013 J jnl
Fast algorithms for min independent dominating set.
Discret. Appl. Math.
Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos
2013 B conf
On the max min vertex cover Problem.
WAOA
Nicolas Boria, Federico Della Croce, Vangelis Th. Paschos
2012 J jnl
A note on "Two-machine flow-shop scheduling with rejection" and its link with flow-shop scheduling and common due date assignment.
Comput. Oper. Res.
Vincent T'kindt, Federico Della Croce
2012 J jnl
A note on minimizing the sum of quadratic completion times on two identical parallel machines.
Inf. Process. Lett.
Federico Della Croce, Christos Koulamas
2012 J jnl
Algorithms for dominating clique problems.
Theor. Comput. Sci.
Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos
2012 — conf
Efficient Algorithms for the max k -vertex cover Problem.
IFIP TCS
Federico Della Croce, Vangelis Th. Paschos
2012 J jnl
Improved LP-based algorithms for the closest string problem.
Comput. Oper. Res.
Federico Della Croce, Fabio Salassa
2012 J jnl
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem.
Comput. Oper. Res.
Federico Della Croce, Andrea Grosso
2012 J jnl
Improving an exact approach for solving separable integer quadratic knapsack problems.
J. Comb. Optim.
Federico Della Croce, Dominique Quadri
2012 J jnl
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem.
Comput. Oper. Res.
Federico Della Croce, Thierry Garaix, Andrea Grosso
2011 B conf
A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem.
EvoCOP
Federico Della Croce, Andrea Grosso, Fabio Salassa
2011 J jnl
A note on "Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time".
Comput. Ind. Eng.
Federico Della Croce, E. Desmier, Thierry Garaix
2011 J jnl
Computational experience with a core-based reduction procedure for the 2-knapsack problem.
Comput. Oper. Res.
Federico Della Croce, Andrea Grosso
2011 J jnl
Discrete-time, economic lot scheduling problem on multiple, non-identical production lines.
Eur. J. Oper. Res.
Ramesh Bollapragada, Federico Della Croce, Marco Ghirardi
2010 J jnl
Approximating the metric 2-Peripatetic Salesman Problem.
Algorithmic Oper. Res.
Federico Della Croce, Vangelis Th. Paschos, Roberto Wolfler Calvo
2010 J jnl
Improving the preemptive bound for the single machine dynamic maximum lateness problem.
Oper. Res. Lett.
Federico Della Croce, Vincent T'kindt
2010 J jnl
Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances.
J. Sched.
Philippe Baptiste, Federico Della Croce, Andrea Grosso, Vincent T'kindt
2009 J jnl
A heuristic approach for the max-min diversity problem based on max-clique.
Comput. Oper. Res.
Federico Della Croce, Andrea Grosso, Marco Locatelli
2009 J jnl
Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2.
Discret. Appl. Math.
Alexey Baburin, Federico Della Croce, Edward Gimadi, Y. V. Glazkov, Vangelis Th. Paschos
2009 B conf
Exact Algorithms for Dominating Clique Problems.
ISAAC
Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos
2009 J jnl
Probabilistic graph-coloring in bipartite and split graphs.
J. Comb. Optim.
Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos
2008 J jnl
Complexity of single machine scheduling problems under scenario-based uncertainty.
Oper. Res. Lett.
Mohamed Ali Aloulou, Federico Della Croce
2008 J jnl
Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems.
Oper. Res.
Federico Della Croce, Vangelis Th. Paschos
2007 J jnl
An exact algorithm for MAX-CUT in sparse graphs.
Oper. Res. Lett.
Federico Della Croce, Marcin Jakub Kaminski, Vangelis Th. Paschos
2007 J jnl
Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria.
INFORMS J. Comput.
Vincent T'kindt, Federico Della Croce, Jean-Louis Bouquard
2007 J jnl
Improved worst-case complexity for the MIN 3-SET COVERING problem.
Oper. Res. Lett.
Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos
2006 J jnl
A "maximum node clustering" problem.
J. Comb. Optim.
Giuliana Carello, Federico Della Croce, Andrea Grosso, Marco Locatelli
2006 J jnl
Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 2.
Electron. Notes Discret. Math.
Yury Glazkov, Alexey Baburin, Edward Gimadi, Federico Della Croce, Vangelis Th. Paschos
2006 J jnl
Scheduling the Italian Football League: an ILP-based approach.
Comput. Oper. Res.
Federico Della Croce, Dario Oliveri
2005 B conf
Computing Optimal Solutions for the min 3-set covering Problem.
ISAAC
Federico Della Croce, Vangelis Th. Paschos
2005 — conf
Probabilistic Coloring of Bipartite and Split Graphs.
ICCSA (4)
Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos
2004 J jnl
A greedy-based neighborhood search approach to a nurse rostering problem.
Eur. J. Oper. Res.
F. Bellanti, Giuliana Carello, Federico Della Croce, Roberto Tadei
2004 J jnl
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem.
Oper. Res. Lett.
Andrea Grosso, Federico Della Croce, Roberto Tadei
2004 J jnl
Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem.
J. Heuristics
Andrea Grosso, Marco Locatelli, Federico Della Croce
2004 J jnl
Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem.
J. Sched.
Federico Della Croce, Andrea Grosso, Vangelis Th. Paschos
2004 J jnl
On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints.
Networks
Luigi De Giovanni, Federico Della Croce, Roberto Tadei
2004 J jnl
Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems.
J. Heuristics
Federico Della Croce, Marco Ghirardi, Roberto Tadei
2004 J jnl
Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems.
J. Sched.
Vincent T'kindt, Federico Della Croce, Carl Esswein
2004 J jnl
Solving the Hub location problem in telecommunication network design: A local search approach.
Networks
Giuliana Carello, Federico Della Croce, Marco Ghirardi, Roberto Tadei
2003 J jnl
Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
Oper. Res. Lett.
Federico Della Croce, Vincent T'kindt
2002 J jnl
A Heuristic Algorithm for the Auto-Carrier Transportation Problem.
Transp. Sci.
Roberto Tadei, Guido Perboli, Federico Della Croce
2002 J jnl
A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem.
J. Oper. Res. Soc.
Federico Della Croce, Vincent T'kindt
2002 J jnl
An improved branch-and-bound algorithm for the two machine total completion time flow shop problem.
Eur. J. Oper. Res.
Federico Della Croce, Marco Ghirardi, Roberto Tadei
2002 J jnl
Finding the Pareto-optima for the total and maximum tardiness single machine problem.
Discret. Appl. Math.
Roberto Tadei, Andrea Grosso, Federico Della Croce
2000 J jnl
Minimizing tardy jobs in a flowshop with common due date.
Eur. J. Oper. Res.
Federico Della Croce, Jatinder N. D. Gupta, Roberto Tadei
1999 J jnl
An improved general procedure for lexicographic bottleneck problems.
Oper. Res. Lett.
Federico Della Croce, Vangelis Th. Paschos, Alexis Tsoukiàs
1999 J jnl
Scheduling a round robin tennis tournamentunder courts and players availability constraints.
Ann. Oper. Res.
Federico Della Croce, Roberto Tadei, P. S. Asioli
1998 J jnl
A new decomposition approach for the single machine total tardiness scheduling problem.
J. Oper. Res. Soc.
Federico Della Croce, Roberto Tadei, Paolo Baracco, Andrea Grosso
1998 J jnl
Minimising makespan in the two-machine flow-shop with release times.
J. Oper. Res. Soc.
Roberto Tadei, Jatinder N. D. Gupta, Federico Della Croce, M. Cortesi
1995 J jnl
A genetic algorithm for the job shop problem.
Comput. Oper. Res.
Federico Della Croce, Roberto Tadei, Giuseppe Volta
1994 A* conf
Production Scheduling for Perishable Goods: A Case Study.
ICRA
Giuseppe Menga, Roberto Tadei, M. Trubian, Giuseppe Volta, Federico Della Croce
1993 — conf
On Minimizing the Weighted Sum Of Quadratic Completion Times on a Single Machine.
ICRA (3)
Federico Della Croce, Roberto Tadei, Paolo Baracco, Raffaele Di Tullio
1992 A* conf
Cellular control of flexible manufacturing systems.
ICRA
Federico Della Croce, Giuseppe Menga, Roberto Tadei, M. Cavalotto, L. Petri