16 citations · 29 across the 4 of their papers we have counts for
5 papers
Heuristic approaches for solving a bilevel optimistic scheduling problem on parallel machines
Quentin Schau, Federico Della Croce, Olivier Ploton +1
This work addresses the uniform parallel machine scheduling problem within an optimistic bilevel optimization framework. The leader seeks to minimize the weighted number of tardy j…
Revisiting Johnson's rule for minimizing makespan in the Two-Machine Flow Shop scheduling problem
Federico Della Croce, Quentin Schau
We consider Johnson's rule for minimizing the makespan in the two-machine flow shop problem. Although its worst-case time complexity is O(n log n), we show that it is possible to d…
ITERATED INSIDE OUT: a new exact algorithm for the transportation problem
Roberto Bargetto, Federico Della Croce, Rosario Scatamacchia
We propose a novel exact algorithm for the transportation problem, one of the paradigmatic network optimization problems. The algorithm, denoted Iterated Inside Out, requires in in…
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem
F Croce, Thierry Garaix, A. Grosso
We present computational results with a heuristic algorithm for the parallel machines total weighted tardiness problem. The algorithm combines generalized pairwise interchange neig…
Fast algorithms for min independent dominating set
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
We first devise a branching algorithm that computes a minimum independent dominating set on any graph with running time O*(2^0.424n) and polynomial space. This improves the O*(2^0.…