International Journals


  • [18] Exact Approaches for the Knapsack Problem with Setups, F. Furini, M. Monaci, E. Traversi, Computers & Operations Research, 2018. Elsevier. DOI:10.1016/j.cor.2017.09.019 pdf
  • [17] Improving the Approximated Projected Perspective Reformulation by Dual Information, A.Frangioni, F. Furini, C. Gentile, Operations Research Letters, 2017. Elsevier. DOI:10.1016/j.orl.2017.08.001. pdf
  • [16] An Effective Dynamic Programming Algorithm for the Minimum-Cost Maximal Knapsack Packing Problem, F. Furini, I. Ljubic, M. Sinnl, European Journal of Operational Research, 2017. Elsevier.DOI:10.1016/j.ejor.2017.03.061. pdf
  • [15] An improved DSATUR-based Branch and Bound for the Vertex Coloring Problem, F. Furini, V. Gabrel, I. C. Ternier, Networks, 2016. Wiley. DOI:10.1002/net.21716. pdf
  • [14] Solving Vertex Coloring Problems as Maximum Weight Stable Set Problems, D. Cornaz, F. Furini, E. Malaguti, Discrete Applied Mathematics, 2016. Elsevier. DOI:10.1016/j.dam.2016.09.018. pdf
  • [13] The Time Dependent Traveling Salesman Planning Problem in Controlled Airspace, F. Furini, C.A. Persiani, P. Toth, Transportation Research Part B, 2016. Elsevier. DOI:10.1016/j.trb.2016.04.009. pdf
  • [12] Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming, F. Furini, E. Malaguti, D. Thomopulos, INFORMS Journal on Computing, 2016. INFORMS. DOI:10.1287/ijoc.2016.0710. pdf
  • [11] Approximated Perspective Relaxations: a Project&Lift Approach, A. Frangioni, F. Furini, C. Gentile, Computational Optimization and Applications, 2016. Springer. DOI:10.1007/s10589-015-9787-8. pdf
  • [10] Solving the Temporal Knapsack Problem via Recursive Dantzig–Wolfe Reformulation, A. Caprara, F. Furini, E. Malaguti, E. Traversi. Information Processing Letters, 2016. Elsevier. DOI:10.1016/j.ipl.2016.01.008. pdf
  • [9] Approaches to a real-world train timetabling problem in a railway node, V. Cacchiani, F. Furini and M.P. Kidd. Omega, 2015. Elsevier. DOI:10.1016/j.omega.2015.04.006. pdf
  • [8] Heuristic and exact algorithms for the interval min-max regret knapsack problem, F. Furini, M. Iori, S. Martello, M. Yagiura. INFORMS Journal on Computing, 2015. INFORMS. DOI:10.1287/ijoc.2014.0632. pdf
  • [7] Improved Rolling Horizon Algorithms for the Aircraft Sequencing Problem, F. Furini, M. P. Kidd, C. Persiani, P. Toth. Journal of Scheduling, 2015. Springer. DOI:10.1007/s10951-014-0415-8. pdf
  • [6] Automatic Dantzig-Wolfe Reformulation of Mixed Integer Programs, M. Bergner, A. Caprara, A. Ceselli, F. Furini, M. E. Lübbecke, E. Malaguti, E. Traversi, Mathematical Programming, 2014. Springer. DOI:10.1007/s10107-014-0761-5. pdf
  • [5] Generation of antipodal random vectors with prescribed non-stationary 2-nd order statistics, A. Caprara, F. Furini, A Lodi, M Mangia, R Rovatti and G. Setti, IEEE Transactions on Signal Processing, 2014. IEEE. DOI:10.1109/TSP.2014.2302737. pdf
  • [4] Models for the Two-Dimensional Two-Stage Cutting Stock Problem with Multiple Stock Size, F. Furini, E. Malaguti, Computers & Operations Research, 2013. Elsevier. DOI:10.1016/j.cor.2013.02.026. pdf
  • [3] Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem, A. Caprara, F. Furini, E. Malaguti, INFORMS Journal on Computing, 2013. INFORMS. DOI:10.1287/ijoc.1120.0521. pdf
  • [2] A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size, F. Furini, E. Malaguti, R. M. Durán, A. Persiani, P. Toth, European Journal of Operational Research, 2012. Elsevier. DOI: 10.1016/j.ejor.2011.10.018. pdf

Proceedings of International Conferences


  • [12] ILP Models and Column Generation for the Minimum Sum Coloring Problem, F. Furini, E. Malaguti, S. Martin and I.-C. Ternier. Electronic Notes in Discrete Mathematics (INOC 2017). Elsevier (To appear).
  • [10] MIP Formulations for a Rich Real-world Lot-sizing Problem with Setup Carryover, F. Focacci, F. Furini, V. Gabrel, D. Godard and X. Shen, Lecture Notes in Computer Science (ISCO 2016), 2016. Springer, DOI: 10.1007/978-3-319-45587-7_11
  • [9] A pseudo-polynomial size formulation for 2-stage two-dimensional knapsack problems, F. Furini and E. Malaguti, Conference Proceedings (CIE45), 2015. Computers and Industrial Engineering ISBN: 978-1-5108-1745-6
  • [8] Lower Bounding Techniques for DSATUR-based Branch and Bound, F. Furini, V. Gabrel, I. C. Ternier. Electronic Notes in Discrete Mathematics (INOC 2015). Elsevier. DOI:10.1016/j.endm.2016.03.020.
  • [7] ILP and CP Formulations for the Lazy Bureaucrat Problem, F. Furini, I. Ljubic, M. Sinnl. Lecture Notes in Computer Science (CPAIOR 2015), 2015. Springer. DOI: 10.1007/978-3-319-18008-3_18.
  • [6] Mathematical Formulations for the Balanced Vertex k -Separator Problem , D. Cornaz, F. Furini, M. Lacroix, E. Malaguti, A. R. Mahjoub, S. Martin, IEEE Conference (CODIT 2014), 2014. DOI: 10.1109/CoDIT.2014.6996889.
  • [5] State space reduced dynamic programming for the aircraft sequencing problem with constrained position shifting, F. Furini , M. P. Kidd, A. Persiani, P. Toth, Lecture Notes in Computer Science (ISCO 2014), 2014. Springer. DOI: 10.1007/978-3-319-09174-7_23.
  • [4] A fast heuristic approach for train timetabling in a railway node, F. Furini , M. P. Kidd, Electronic Notes in Discrete Mathematics (INOC 2013), 2013. Elsevier. DOI: 10.1016/j.endm.2013.05.094.
  • [2] Aircraft Sequencing Problems via a Rolling Horizon Algorithm, F. Furini , A. Persiani, P. Toth, Lecture Notes in Computer Science (ISCO 2012), 2012. Springer. DOI: 10.1007/978-3-642-32147-4_25.
  • [1] Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation, M. Bergner, A. Caprara, F. Furini, M. E. Lübbecke, E. Malaguti, E. Traversi, Lecture Notes in Computer Science (IPCO 2011), 2011. Springer. DOI: 10.1007/978-3-642-20807-2_4.

Papers in Online Repositories


  • The Vertex k-cut Problem, D. Cornaz, F. Furini, M. Lacroix, E. Malaguti, A. R. Mahjoub, S. Martin, Optimization Online, 2017. Mathematical Optimization Society. web page.
  • QPLIB: A Library of Quadratic Programming Instances, F. Furini, E. Traversi, P. Belotti, A. Frangioni, A. Gleixner, N. Gould, L. Liberti, A. Lodi, R. Misener, H. Mittelmann, N. Sahinidis, S. Vigerske and A. Wiegele , Optimization Online, 2017. Mathematical Optimization Society. web page.
  • Exact and Heuristic Algorithms for the Partition Coloring Problem, F. Furini, E. Malaguti and A. Santini , Optimization Online, 2016. Mathematical Optimization Society. web page.
  • New MIP Models for Liner Shipping Route Design with Empty Container Repositioning, L. Alfandari, T. Davidovic, F. Furini, I. Ljubic, V. Maras and S. Martin , Optimization Online, 2016. Mathematical Optimization Society. web page.
  • Social Network Analysis and Community Detection by Decomposing a Graph into Relaxed Cliques, T. Gschwind, S. Irnich, F. Furini, R. Wolfler Calvo, Discussion Paper, 2016. University of Mainz. web page.
  • Extended Linear Formulation for Binary Quadratic Problems, F. Furini and E. Traversi, Optimization Online, 2013. Mathematical Optimization Society. web page.