Publications

The following list includes papers published in international journals and short papers published in conferences proceedings. For recent preprints and other works, please check the links (buttons below) to Arxiv, Scopus and Research Gate.

  • P. Hosteins, R. Scatamacchia. The stochastic critical node problem over trees. Networks, 76: 381-401, 2020. DOI: 10.1002/net.21948.

  • F. Della Croce, R. Scatamacchia. An exact approach for the bilevel knapsack problem with interdiction constraints and extensions. Mathematical Programming, 183: 249-281, 2020. DOI: 10.1007/s10107-020-01482-5.

  • F. Della Croce, R. Scatamacchia. The Longest Processing Time rule for identical parallel machines revisited. Journal of Scheduling, 23: 163-176, 2020. DOI: 10.1007/s10951-018-0597-6.

  • F. Della Croce, G. Dragotto, R. Scatamacchia. On fairness and diversification in WTA and ATP tennis tournaments generation. Annals of Operations Research, (in press) 2020. DOI: 10.1007/s10479-020-03517-8.

  • A. Alfieri, S. Zhou, R. Scatamacchia, S.L. van de Velde. Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop. 4OR, (in press) 2020. DOI: 10.1007/s10288-020-00449-8.

  • F. Della Croce, R. Scatamacchia. Lower Bounds and a New Exact Approach for the Bilevel Knapsack with Interdiction Constraints. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Volume 11480 LNCS, 2019, Pages 155-167, 20th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2019, DOI: 10.1007/978-3-030-17953-3_12.

  • F. Della Croce, U. Pferschy, R. Scatamacchia. On approximating the Incremental Knapsack Problem. Discrete Applied Mathematics, 264: 26-42, 2019, DOI: 10.1016/j.dam.2019.02.016.

  • F. Della Croce, R. Scatamacchia, V. T'kindt. A tight linear time 13/12-approximation algorithm for the P2||Cmax problem. Journal of Combinatorial Optimization, 38(2) (in press), 2019.

  • R. Aringhieri, A. Grosso, P. Hosteins, R. Scatamacchia. Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem, Discrete Applied Mathematics, 253: 103-121, 2019, DOI: 10.1016/j.dam.2017.12.035.

  • F. Della Croce, U. Pferschy, R. Scatamacchia. New exact approaches and approximation results for the Penalized Knapsack Problem. Discrete Applied Mathematics, 253: 122-135, 2019, DOI: 10.1016/j.dam.2017.11.023.

  • F. Della Croce, U. Pferschy, R. Scatamacchia. Approximating the 3-period Incremental Knapsack Problem. Journal of Discrete Algorithms. 52-53: 55-69, 2018, DOI: 10.1016/j.jda.2018.11.005.

  • U. Pferschy, R. Scatamacchia. Improved dynamic programming and approximation results for the knapsack problem with setups. International Transactions in Operational Research, 25: 667-682, 2018. DOI: 10.1111/itor.12381.

  • F. Della Croce, U. Pferschy, R. Scatamacchia. Approximation Results for the Incremental Knapsack Problem. In: Brankovic L., Ryan J., Smyth W. (eds) Combinatorial Algorithms. IWOCA 2017. Lecture Notes in Computer Science, vol. 10765, pp. 75-87, 2018. DOI: 10.1007/978-3-319-78825-8_7.

  • R. Scatamacchia. Knapsack Problems with Side Constraints, 2017. DOI:10.6092/polito/porto/2667802. Free download here.

  • F. Della Croce, F. Salassa, R. Scatamacchia. A new exact approach for the 0-1 Collapsing Knapsack Problem. European Journal of Operational Research, 260: 56-69, 2017. DOI: 10.1016/j.ejor.2016.12.009.

  • F. Della Croce, F. Salassa, R. Scatamacchia. An exact approach for the 0-1 knapsack problem with setups. Computers & Operations Research, 80:61-67, 2017. DOI: 10.1016/j.cor.2016.11.015.

  • R. Aringhieri, A. Grosso, P. Hosteins, R. Scatamacchia. A General Evolutionary Framework for different classes of Critical Node Problems. Engineering Applications of Artificial Intelligence, 55:128-145, 2016. DOI: 10.1016/j.engappai.2016.06.010.

  • R. Aringhieri, A. Grosso, P. Hosteins, R. Scatamacchia. Local search metaheuristics for the critical node problem. Networks, 67:209-221 2016. DOI: 10.1002/net.21671.

  • R. Aringhieri, A. Grosso, P. Hosteins, R. Scatamacchia. VNS solutions for the critical node problem. Electronic Notes in Discrete Mathematics, Proceedings of VNS'14 conference, 47:37-44, 2015. DOI: 10.1016/j.endm.2014.11.006.