Archivio Istituzionale della RicercaDELLA CROCE DI DOJOLA, Federico
DELLA CROCE DI DOJOLA, Federico
Dipartimento di Ingegneria Gestionale e della Produzione
F D Croce; Federico Della Croce; F. Della Croce; Della Croce F; Croce, Federico Della; Croce F D; Della Croce, Federico; Della Croce di Dojola Federico; DELLA CROCE DI DOJOLA, Federico
002189
Exact solution of the two-machine flow shop problem with three operations
2022 Della Croce, Federico; Salassa, Fabio; T’Kindt, Vincent
Improved solution of the Budget constrained Fuel Treatment Scheduling problem and extensions
2022 Della Croce, Federico; Ghirardi, Marco; Scatamacchia, Rosario
Moderate exponential-time algorithms for scheduling problems
2022 T'Kindt, V.; Della Croce, F.; Liedloff, M.
On fairness and diversification in WTA and ATP tennis tournaments generation
2022 Della Croce, F.; Dragotto, G.; Scatamacchia, R.
An improved heuristic approach for the interval immune transportation problem
2021 Carrabs, F.; Cerulli, R.; D'Ambrosio, C.; Della Croce, F.; Gentili, M.
Branch & Memorize exact algorithms for sequencing problems: Efficient embedding of memorization into search trees
2021 Shang, L.; T'Kindt, V.; Della Croce, F.
Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs
2021 Jeunet, J.; Della Croce, F.; Salassa, F.
Merging Combinatorial Design and Optimization: the Oberwolfach Problem
2021 Salassa, FABIO GUIDO MARIO; Dragotto, Gabriele; Traetta, Tommaso; Buratti, Marco; DELLA CROCE DI DOJOLA, Federico
Parallel machine scheduling with minimum number of tardy jobs: Approximation and exponential algorithms
2021 Della Croce, F.; T'Kindt, V.; Ploton, O.
An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
2020 Della Croce, F.; Scatamacchia, R.
Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
2020 T'Kindt, V.; Shang, L.; Della Croce di Dojola, F.
The Longest Processing Time rule for identical parallel machines revisited
2020 Della Croce, Federico; Scatamacchia, Rosario
A tight linear time 13/12-approximation algorithm for the P2||Cmax problem
2019 Della Croce, F.; Scatamacchia, R.; T'Kindt, V.
Minimizing total completion time in the two-machine no-idle no-wait flow shop problem
2019 Della Croce, Federico; Grosso, Andrea; Salassa, Fabio
New exact approaches and approximation results for the Penalized Knapsack Problem
2019 Della Croce, Federico; Pferschy, Ulrich; Scatamacchia, Rosario
No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths
2019 Billaut, J. -C.; Della Croce, F.; Salassa, F.; T’Kindt, V.
On approximating the Incremental Knapsack Problem
2019 Della Croce, F.; Pferschy, U.; Scatamacchia, R.
An exact exponential branch-and-merge algorithm for the single machine total tardiness problem
2018 Garraffa, Michele; Shang, Lei; Della Croce, Federico; T'Kindt, Vincent
Approximating the 3-period Incremental Knapsack Problem
2018 Della Croce, F.; Pferschy, U.; Scatamacchia, R.
A constraint generation approach for two-machine shop problems with jobs selection
2017 Della Croce, Federico; Koulamas, Christos; T'Kindt, Vincent
| Citazione | Data di pubblicazione | Autori | File |
|---|---|---|---|
| Exact solution of the two-machine flow shop problem with three operations / Della Croce, Federico; Salassa, Fabio; T’Kindt, Vincent. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - ELETTRONICO. - 138:(2022), p. 105595. [10.1016/j.cor.2021.105595] | 1-gen-2022 | Della Croce, FedericoSalassa, FabioT’kindt, Vincent | 1-s2.0-S0305054821003178-main.pdf |
| Improved solution of the Budget constrained Fuel Treatment Scheduling problem and extensions / Della Croce, Federico; Ghirardi, Marco; Scatamacchia, Rosario. - In: COMPUTERS & INDUSTRIAL ENGINEERING. - ISSN 0360-8352. - ELETTRONICO. - 168:(2022). [10.1016/j.cie.2022.108139] | 1-gen-2022 | Della Croce, FedericoGhirardi, MarcoScatamacchia, Rosario | 1-s2.0-S0360835222002091-main.pdf |
| Moderate exponential-time algorithms for scheduling problems / T'Kindt, V.; Della Croce, F.; Liedloff, M.. - In: 4OR. - ISSN 1619-4500. - 20:4(2022), pp. 533-566. [10.1007/s10288-022-00525-1] | 1-gen-2022 | T'kindt V.Della Croce F. + | s10288-022-00525-1.pdf |
| On fairness and diversification in WTA and ATP tennis tournaments generation / Della Croce, F.; Dragotto, G.; Scatamacchia, R.. - In: ANNALS OF OPERATIONS RESEARCH. - ISSN 0254-5330. - ELETTRONICO. - 316:2(2022), pp. 1107-1119. [10.1007/s10479-020-03517-8] | 1-gen-2022 | Della Croce F.Dragotto G.Scatamacchia R. | DellaCroce2020_Article_OnFairnessAndDiversificationIn.pdf; Tennis_ANOR.pdf |
| An improved heuristic approach for the interval immune transportation problem / Carrabs, F.; Cerulli, R.; D'Ambrosio, C.; Della Croce, F.; Gentili, M.. - In: OMEGA. - ISSN 0305-0483. - ELETTRONICO. - 104:(2021), p. 102492. [10.1016/j.omega.2021.102492] | 1-gen-2021 | Della Croce F. + | 1-s2.0-S0305048321001018-main.pdf |
| Branch & Memorize exact algorithms for sequencing problems: Efficient embedding of memorization into search trees / Shang, L.; T'Kindt, V.; Della Croce, F.. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - ELETTRONICO. - 128:(2021), p. 105171. [10.1016/j.cor.2020.105171] | 1-gen-2021 | T'Kindt V.Della Croce F. + | 1-s2.0-S0305054820302884-main.pdf |
| Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs / Jeunet, J.; Della Croce, F.; Salassa, F.. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - ELETTRONICO. - 127:(2021). [10.1016/j.cor.2020.105151] | 1-gen-2021 | Della Croce F.Salassa F. + | 1-s2.0-S0305054820302689-main.pdf |
| Merging Combinatorial Design and Optimization: the Oberwolfach Problem / Salassa, FABIO GUIDO MARIO; Dragotto, Gabriele; Traetta, Tommaso; Buratti, Marco; DELLA CROCE DI DOJOLA, Federico. - In: THE AUSTRALASIAN JOURNAL OF COMBINATORICS. - ISSN 2202-3518. - 79:1(2021), pp. 141-166. | 1-gen-2021 | Fabio SalassaGabriele DragottoFederico Della Croce + | ajc_v79_p141.pdf |
| Parallel machine scheduling with minimum number of tardy jobs: Approximation and exponential algorithms / Della Croce, F.; T'Kindt, V.; Ploton, O.. - In: APPLIED MATHEMATICS AND COMPUTATION. - ISSN 0096-3003. - ELETTRONICO. - 397:(2021), p. 125888. [10.1016/j.amc.2020.125888] | 1-gen-2021 | Della Croce F.T'kindt V. + | 1-s2.0-S0096300320308419-main.pdf |
| An exact approach for the bilevel knapsack problem with interdiction constraints and extensions / Della Croce, F.; Scatamacchia, R.. - In: MATHEMATICAL PROGRAMMING. - ISSN 0025-5610. - 183:1-2(2020), pp. 249-281. [10.1007/s10107-020-01482-5] | 1-gen-2020 | Della Croce F.Scatamacchia R. | Final_Revised_mathprog.pdf; DellaCroce-Scatamacchia2020_Article_AnExactApproachForTheBilevelKn.pdf |
| Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights / T'Kindt, V.; Shang, L.; Della Croce di Dojola, F.. - In: JOURNAL OF COMBINATORIAL OPTIMIZATION. - ISSN 1382-6905. - ELETTRONICO. - 39:3(2020), pp. 764-775. [10.1007/s10878-019-00512-z] | 1-gen-2020 | T'kindt V.Della Croce di Dojola F. + | TKindt2020_Article_ExponentialTimeAlgorithmsForJu.pdf |
| The Longest Processing Time rule for identical parallel machines revisited / Della Croce, Federico; Scatamacchia, Rosario. - In: JOURNAL OF SCHEDULING. - ISSN 1094-6136. - 23:2(2020), pp. 163-176. [10.1007/s10951-018-0597-6] | 1-gen-2020 | Della Croce, FedericoScatamacchia, Rosario | DellaCroce-Scatamacchia2020_Article_TheLongestProcessingTimeRuleFo.pdf |
| A tight linear time 13/12-approximation algorithm for the P2||Cmax problem / Della Croce, F.; Scatamacchia, R.; T'Kindt, V.. - In: JOURNAL OF COMBINATORIAL OPTIMIZATION. - ISSN 1382-6905. - 38:2(2019), pp. 608-617. [10.1007/s10878-019-00399-w] | 1-gen-2019 | Della Croce F.Scatamacchia R. + | - |
| Minimizing total completion time in the two-machine no-idle no-wait flow shop problem / Della Croce, Federico; Grosso, Andrea; Salassa, Fabio. - In: JOURNAL OF HEURISTICS. - ISSN 1381-1231. - (2019). [10.1007/s10732-019-09430-z] | 1-gen-2019 | Della Croce, FedericoSalassa, Fabio + | - |
| New exact approaches and approximation results for the Penalized Knapsack Problem / Della Croce, Federico; Pferschy, Ulrich; Scatamacchia, Rosario. - In: DISCRETE APPLIED MATHEMATICS. - ISSN 0166-218X. - 253:(2019), pp. 122-135. [10.1016/j.dam.2017.11.023] | 1-gen-2019 | Della Croce, FedericoScatamacchia, Rosario + | - |
| No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths / Billaut, J. -C.; Della Croce, F.; Salassa, F.; T’Kindt, V.. - In: JOURNAL OF SCHEDULING. - ISSN 1094-6136. - 22:1(2019), pp. 59-68. [10.1007/s10951-018-0562-4] | 1-gen-2019 | Della Croce, F.Salassa, F. + | - |
| On approximating the Incremental Knapsack Problem / Della Croce, F.; Pferschy, U.; Scatamacchia, R.. - In: DISCRETE APPLIED MATHEMATICS. - ISSN 0166-218X. - 264:(2019), pp. 26-42. [10.1016/j.dam.2019.02.016] | 1-gen-2019 | Della Croce F.Scatamacchia R. + | - |
| An exact exponential branch-and-merge algorithm for the single machine total tardiness problem / Garraffa, Michele; Shang, Lei; Della Croce, Federico; T'Kindt, Vincent. - In: THEORETICAL COMPUTER SCIENCE. - ISSN 0304-3975. - 745:(2018), pp. 133-149. [10.1016/j.tcs.2018.05.040] | 1-gen-2018 | Della Croce, Federico + | - |
| Approximating the 3-period Incremental Knapsack Problem / Della Croce, F.; Pferschy, U.; Scatamacchia, R.. - In: JOURNAL OF DISCRETE ALGORITHMS. - ISSN 1570-8667. - 52-53:(2018), pp. 55-69. [10.1016/j.jda.2018.11.005] | 1-gen-2018 | Della Croce F.Scatamacchia R. + | - |
| A constraint generation approach for two-machine shop problems with jobs selection / Della Croce, Federico; Koulamas, Christos; T'Kindt, Vincent. - In: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. - ISSN 0377-2217. - ELETTRONICO. - 259:3(2017), pp. 898-905. [10.1016/j.ejor.2016.11.036] | 1-gen-2017 | Della Croce, Federico + | - |