Tiziano Bacci
Tiziano Bacci Tiziano Bacci
Researcher

Istituto di Analisi dei Sistemi ed Informatica "Antonio Ruberti"
Via dei Taurini, 19
00185 Roma - Italy

Office n. 314
Tel.: +39 06 4993 7138
Fax: +39 06 4993 7106
email

Research groups

Selected publications
  • Tiziano Bacci, Frangioni A., Claudio Gentile: START-UP/SHUT-DOWN MINLP FORMULATIONS FOR THE UNIT COMMITMENT WITH RAMP CONSTRAINTS, IASI-CNR, R. 20-01, 1/2020
  • Tiziano Bacci, Sara Mattia, Paolo Ventura: A Branch and Cut algorithm for the Restricted Block Relocation Problem, European Journal of Operational Research in press, DOI 10.1016/j.ejor.2020.05.029, 2020
  • Tiziano Bacci, Frangioni A., Claudio Gentile: A counterexample to an exact extended formulation for the single-unit commitment problem, IASI-CNR, R. 19-03, 2019
  • Tiziano Bacci, Frangioni A., Claudio Gentile, Tavlaridis-Gyparakis K.: New MI-SOCP Formulations for the Unit Commitment Problems with Ramping Constraints, IASI-CNR, R. 19-04, 2019
  • Tiziano Bacci, Sara Mattia, Paolo Ventura: The Bounded Beam Search algorithm for the Block Relocation Problem, Computers & Operations Research 103, 252-264, 2019
  • Tiziano Bacci, Sara Mattia, Paolo Ventura: A new lower bound for the Block Relocation Problem, in the Proceedings of ICCL 2018, Lecture Notes in Computer Science, 11184, pp. 168–174, 2018
  • Tiziano Bacci, Sara Nicoloso: A heuristic algorithm for the Bin Packing Problem with Conflicts on interval graphs, IASI-CNR, R. 18-03, 9/2018
  • Tiziano Bacci, Sara Nicoloso: On the benchmark instances for the Bin Packing with Conflicts, IASI-CNR, R. 18-04, 9/2018
  • Tiziano Bacci, Sara Mattia, Paolo Ventura: Some Complexity Results for the Minimum Blocking Items Problem, in the Proceedings of ODS 2017, Springer Proceedings in Mathematics & Statistics, 217, pp. 475-483, 2017
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -