Matteo Fischetti

1. [1]
   M. Fischetti, “Worst-Case Analysis of an Approximation Scheme for the Subset-Sum Problem”, Operations Research Letters 6, 283-284, 1986.
2. [2]
   M. Fischetti, S. Martello, P. Toth, “The Fixed Job Schedule Problem with Spread-Time Constraints”, Operations Research 35, 849-858, 1987.
3. [3]
   M. Fischetti, S. Martello, “Worst-Case Analysis of the Differencing Method for the Partition Problem” Mathematical Programming A 37, 117-120, 1987.
4. [4]
   M. Fischetti, S. Martello,“A Hybrid Algorithm for Finding the k -th Smallest of n Elements in O(n) Time”, Annals of Operations Research 13, 401-419, 1988.
5. [5]
   M. Fischetti, P. Toth, “An Additive Approach for the Optimal Solution of the Prize-Collecting Travelling Salesman Problem” in Vehicle Routing: Methods and Studies (B.L. Golden and A.A. Assad ed.s), North Holland, Amsterdam, 319-343, 1988.
6. [6]
   M. Fischetti, P. Toth, “A New Dominance Procedure for Combinatorial Optimization Problems” Operations Research Letters 7, 181-187, 1988.
7. [7]
   M. Fischetti, S. Martello, P. Toth, “The Fixed Job Schedule Problem with Working-Time Constraints”, Operations Research 37, 395-403, 1989.
8. [8]
   M. Fischetti, P. Toth, “An Additive Bounding Procedure for Combinatorial Optimization Problems”, Operations Research 37, 319-328, 1989.
9. [9]
   G. Carpaneto, M. Dell'Amico, M. Fischetti, P. Toth, “A Branch and Bound Algorithm for the Multiple Depot Vehicle Scheduling Problem”, Networks 19, 531-548, 1989.
10. [10]
    G. Carpaneto, M. Fischetti, P. Toth, “New Lower Bounds for the Symmetric Travelling Salesman Problem”, Mathematical Programming B 45, 233-254, 1989.
11. [11]
    M. Fischetti, “A New Linear Storage, Polynomial-Time Approximation Scheme for the Subset-Sum Problem”, Discrete Applied Mathematics 26, 61-77, 1990.
12. [12]
    M. Fischetti, “Facets of the Asymmetric Traveling Salesman Polytope”, Mathematics of Operations Research 16, 42-56, 1991.
13. [13]
    M. Fischetti, “Facets of Two Steiner Arborescence Polyhedra”, Mathematical Programming A 51, 401-419, 1991.
14. [14]
    M. Fischetti, P. Toth, “An Additive Bounding Procedure for the Asymmetric Travelling Salesman Problem”, Mathematical Programming A 53, 173-197, 1992.
15. [15]
    M. Fischetti, S. Martello, P. Toth, “Approximate Algorithms for Fixed Job Schedule Problems” Operations Research 40, S96-S108, 1992.
16. [16]
    E. Balas, M. Fischetti, “The Fixed Out-Degree 1-Arborescence Polytope”, Mathematics of Operations Research 17, 1001-1018, 1992.
17. [17]
    M. Fischetti, “Three Lifting Theorems for the Asymmetric Traveling Salesman Polytope”; in Integer Programming and Combinatorial Optimization (E. Balas, G. Cornuejols, R. Kannan ed.s), IPCO II Proceedings, Carnegie Mellon University, Pittsburgh, 260-273, 1992.
18. [18]
    M. Dell'Amico, M. Fischetti, P. Toth, “Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem”, Management Science 39, 115-125, 1993.
19. [19]
    M. Fischetti, G. Laporte, S. Martello, “The Delivery Man Problem and Cumulative Matroids”, Operations Research 41, 1055-1064, 1993.
20. [20]
    E. Balas, M. Fischetti, “A Lifting Procedure for the Asymmetric Traveling Salesman Polytope and a Large New Class of Facets”, Mathematical Programming A 58, 325-352, 1993.
21. [21]
    M. Fischetti, P. Toth, “An Efficient Algorithm for the Min-Sum Arborescence Problem”, ORSA Journal on Computing 5, 426-434, 1993.
22. [22]
    M. Fischetti, P. Toth, D. Vigo, “A Branch and Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs”, Operations Research 42, 846-859, 1994.
23. [23]
    M. Fischetti, H.W. Hamacher, K. Joernsten, F. Maffioli, “k -Cardinality Trees: Complexity and Polyhedral Structure”, Networks 24, 11-21, 1994.
24. [24]
    M. Fischetti, “Clique Tree Inequalities Define Facets of the Asymmetric Traveling Salesman Polytope”, Discrete Applied Mathematics 56, 9-18, 1995.
25. [25]
    E. Balas, M. Fischetti, W.R. Pulleyblank, “The Precedence-Constrained Asymmetric Traveling Salesman Polytope”, Mathematical Programming A, 68, 241-265, 1995.
26. [26]
    M. Fischetti, J.J. Salazar, P. Toth, “The Symmetric Generalized Travelling Salesman Polytope”, Networks , 26/2, 113-123, 1995.
27. [27]
    A. Caprara, M. Fischetti, D. Maio, “Exact and Approximate Algorithms for the Index Selection Problem in Physical Database Design”, IEEE Transactions on Knowledge and Data Engineering, 7/6, 955-967, 1995.
28. [28]
    A. Caprara, M. Fischetti, “0-1/2 Chvatal-Gomory Cuts”, Mathematical Programming A, 74, 221-235, 1996.
29. [29]
    A. Caprara, M. Fischetti, “Odd Cut-sets, Odd Cycles, and 0-1/2 Chvatal-Gomory Cuts”, Ricerca Operativa, 26, 51-80, 1996.
30. [30]
    M. Fischetti, D. Vigo, “A Branch-and-Cut Algorithm for the Resource-Constrained Arborescence Problem”, Networks 29, 55-67, 1997.
31. [31]
    M. Fischetti, J.J. Salazar, P. Toth, “A Branch-and-Cut Algorithm for the Symmetric Generalized Travelling Salesman Problem”, Operations Research 45, 3, 378-393, 1997.
32. [32]
    A. Caprara, M. Fischetti, P. Toth, D. Vigo, P.L. Guida, “Algorithms for Railway Crew Management”, Mathematical Programming B 79, 125-141, 1997.
33. [33]
    A. Caprara, M. Fischetti, “Branch-and-Cut Algorithms: an Annotated Bibliography”, in Annotated Bibliographies in Combinatorial Optimization, M. Dell'Amico, F. Maffioli and S. Martello eds., John Wiley and Sons, 45-63, 1997.
34. [34]
    E. Balas, M. Fischetti, “On the Monotonization of Polyhedra”, Mathematical Programming A 78, 59-84, 1997.
35. [35]
    M. Fischetti, P. Toth, “A Polyhedral Approach to the Asymmetric Traveling Salesman Problem”, Management Science 43, 11, 1520-1536, 1997.
36. [36]
    M. Fischetti, J.J. Salazar, P. Toth, “Solving the Orienteering Problem Through Branch and Cut”, INFORMS Journal on Computing 10, 2, 133-148, 1998.
37. [37]
    M. Fischetti, J.J. Salazar, “Experiments with Controlled Rounding for Statistical Disclosure Control in Tabular Data with Linear Constraints”, Journal of Official Statistics 17, 4, 101-113, 1998.
38. [38]
    A. Caprara, M. Fischetti, P. Toth, D. Vigo, “Models and Algorithms for the Crew Rostering”, Operations Research 46, 6, 820-830, 1998.
39. [39]
    M. Fischetti, J.J. Salazar, “Models and Algorithms for the Cell Suppression Problem in Statistical Disclosure Control”, Mathematical Programming A 84, 283-312, 1999.
40. [40]
    E. Balas, M. Fischetti, “Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem”, Mathematics of Operations Research 24, 2, 273-292, 1999.
41. [41]
    A. Caprara, M. Fischetti, P. Toth, “A Heuristic Method for the Set Covering Problem”, Operations Research 47, 5, 730-743, 1999.
42. [42]
    M. Fischetti, P.L. Guida, “I Turni delle Locomotive” in S. Pallottino, A. Sciomachen (eds.), Scienze delle Decisioni per i Trasporti, Collana Trasporti, Franco Angeli, 476-494, 1999 (in Italian).
43. [43]
    A. Caprara, M. Fischetti, P.L. Guida, P. Toth, D. Vigo, “Solution of Large-Scale Railway Crew Planning Problems: the Italian Experience” in N.H.M. Wilson (ed.), Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, 1-18, 1999.
44. [44]
    A. Caprara, M. Fischetti, A.N. Letchford, “On the Separation of Maximally Violated Mod-k Cuts”, Mathematical Programming A 87, 37-56, 2000.
45. [45]
    L. Brunetta, M. Conforti, M. Fischetti, “A Polyhedral Approach to a Multicommodity Flow Problem”, Discrete Applied Mathematics 101, 13-36, 2000.
46. [46]
    M. Fischetti, C. Lepschy, G. Minerva, G. Romanin Jacur, E. Toto, “Frequency Assignment in Mobile Radio Systems Using Branch-and-Cut Techniques”, European Journal of Operational Research 123, 241-255, 2000.
47. [47]
    N. Ascheuer, M. Fischetti, M. Groetschel, “A Polyhedral Study of the Asymmetric Travelling Salesman Problem with Time Windows”, Networks 36(2), 69-79, 2000.
48. [48]
    M. Fischetti, J.J. Salazar, “Models and Algorithms for Optimizing Cell Suppression in Tabular Data with Linear Constraints”, Journal of the American Statistical Association 95, 915-928, 2000.
49. [49]
    A. Caprara, P. Toth, M. Fischetti, “Algorithms for the Set Covering Problem” Annals of Operations Research 89, 353-371, 2000.
50. [50]
    N. Ascheuer, M. Fischetti, M. Groetschel, “Solving the Asymmetric Travelling Salesman Problem with Time Windows by Branch-and-Cut” Mathematical Programming A 90, 475-506, 2001.
51. [51]
    M. Fischetti, J.J. Salazar, “Solving the Cell Suppression Problem on Tabular Data with Linear Constraints”, Management Science 47, 7, 1008-1027, 2001.
52. [52]
    M. Fischetti, A. Lodi, S. Martello, P. Toth, “A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems” Management Science 47, 6, 833-850, 2001.
53. [53]
    M. Fischetti, J.J. Salazar, “Combining Complete and Partial Cell Suppression Methodologies in Statistical Disclosure Control”, Statistical Journal of the United Nations ECE 18, 355-361, 2001.
54. [54]
    L. Kroon, M. Fischetti, “Crew Scheduling for Netherlands Railways: Destination Customer”, in S. Voss and J.R. Daduna (ed.s), Computer-Aided Scheduling of Public Transport, Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, 181-201, 2001.
55. [55]
    A. Caprara, M. Fischetti, P.L. Guida, M. Monaci, G. Sacco, P. Toth, “Solution of Real-World Train Timetabling Problems”, Proceedings of the 34-th Hawaii International Conference on System Sciences (HICSS 34), IEEE Computer Society Press, 2001.
56. [56]
    M. Fischetti, G. Lancia, P. Serafini, “Exact Algorithms for Minimum Routing Cost Trees”, Networks 39(3), 161-173, 2002.
57. [57]
    A. Caprara, M. Fischetti, P. Toth, “Modelling and Solving the Train Timetabling Problem”, Operations Research 50(5), 851-861, 2002.
58. [58]
    E. Balas, M. Fischetti, “Polyhedral Theory for the Asymmetric Traveling Salesman Problem”, in The Traveling Salesman Problem and its Variations, G. Gutin and A. Punnen ed.s, Kluwer, 117-168, 2002.
59. [59]
    M. Fischetti, A. Lodi, P. Toth, “Exact Methods for the Asymmetric Traveling Salesman Problem”, in The Traveling Salesman Problem and its Variations, G. Gutin and A. Punnen ed.s, Kluwer, 169-206, 2002.
60. [60]
    M. Fischetti, J.J. Salazar, P. Toth, “The Generalized Traveling Salesman and Orienteering Problems”, in The Traveling Salesman Problem and its Variations, G. Gutin and A. Punnen ed.s, Kluwer, 609-662, 2002.
61. [61]
    M. Fischetti, G. Romanin Jacur, J.J. Salazar, “Optimisation of the Interconnecting Network of a UMTS Radio Mobile Telephone System”, European Journal of Operational Research, 144, 56–67, 2003.
62. [62]
    M. Fischetti, J.J. Salazar, “Partial Cell Suppression: A new Methodology for Statistical Disclosure Control”, Statistics and Computing 13, 13-21, 2003.
63. [63]
    M. Fischetti, A. Lodi, “Local Branching”, Mathematical Programming B, 98, 23-47, 2003.
64. [64]
    M. Fischetti, C. Polo, M. Scantamburlo, “A Local Branching Heuristic for Mixed-Integer Programs with 2-Level Variables”, Networks 44, 2, 61-72, 2004.
65. [65]
    E. Abbink, M. Fischetti, L. Kroon, G. Timmer, M. Vromans, “Reinventing Crew Scheduling at Netherlands Railways”, Interfaces 35(5), 393-401, 2005 (finalist of the 2004 INFORMS "Daniel H. Wagner Prize for Excellence in Operations Research Practice")
66. [66]
    M. Fischetti, F. Glover, A. Lodi, “The Feasibility Pump”, Mathematical Programming A, 104, 91-104, 2005.
67. [67]
    I. Ljubic, R. Weiskircher, U. Pferschy, G. Klau, P. Mutzel, M. Fischetti, “An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem”, Mathematical Programming B, 105 (2-3), 427-449, 2006.
68. [68]
    R. De Franceschi, M. Fischetti, P.Toth, “A New ILP-based Refinement Heuristic for Vehicle Routing Problems”, Mathematical Programming B, 105 (2-3), 471-499, 2006.
69. [69]
    G. Codato, M. Fischetti, “Combinatorial Benders' Cuts for Mixed-Integer Linear Programming”, Operations Research 54(4), 756-766, 2006.
70. [70]
    E. Balas, R. Carr, M. Fischetti, N. Simonetti, “New Facets of the STS Polytope Generated from Known Facets of the ATS Polytope”, Discrete Optimization 3, 3-19, 2006.
71. [71]
    M. Fischetti, C. Saturni, “Mixed-Integer Cuts from Cyclic Groups”, Mathematical Programming A, 109(1), 27-53, 2007.
72. [72]
    L. Bertacco, M. Fischetti, A. Lodi, “A Feasibility Pump Heuristic for General Mixed-Integer Problems”, Discrete Optimization 4, 63-76, 2007.
73. [73]
    M. Fischetti, A. Lodi, “Optimizing over the first Chvatal closure” Mathematical Programming B, 110(1), 3-20, 2007.
74. [74]
    G. Andreello, A. Caprara, M. Fischetti, “Embedding Cuts in a Branch and Cut Framework: a Computational Study with {0,1/2}-Cuts”, INFORMS Journal on Computing 19(2), 229-238, 2007.
75. [75]
    M. Fischetti, A. Lodi, “MIPping closures: an instant survey”, Graphs and Combinatorics 23, 233-243, 2007.
76. [76]
    M. Fischetti, D. Williamson (ed.s), “Integer Programming and Combinatorial Optimization”, Proceedings of the 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007.
77. [77]
    M. Fischetti, A. Lodi, “Repairing MIP infeasibility through Local Branching”, Computers and Operations Research 35, 1436-1445, 2008.
78. [78]
    P. Bonami, G. Cornuejols, S. Dash, M. Fischetti, A. Lodi, “Projected Chvatal-Gomory cuts for Mixed Integer Linear Programs”, Mathematical Programming A 113, 241-257, 2008.
79. [79]
    L. Bertacco, L. Brunetta, M. Fischetti, “The Linear Ordering Problem with Cumulative Costs”, European Journal of Operational Research 189, 1345-1357, 2008.
80. [80]
    M. Fischetti, M. Monaci, “How tight is the corner relaxation?”, Discrete Optimization 5, 262-269, 2008.
81. [81]
    L. Kroon, D. Huisman, E. Abbink, P.-J. Fioole, M. Fischetti, G. Maroti, A. Schrijver, A. Steenbeek, R. Ybema, “The New Dutch Timetable: The O.R. Revolution”, Interfaces 39 (1), 6-17, 2009 (winner of the 2008 Franz Edelman Award "Achievement in Operations Research").
82. [82]
    M. Fischetti, I. Luzzi, “Mixed-integer programming models for nesting problems”, Journal of Heuristics 15(3), 201-226, 2009.
83. [83]
    M. Fischetti, D. Salvagnin, A. Zanette, “Fast approaches to improve the robustness of a railway timetable”, Transportation Science 43, 321-335, 2009.
84. [84]
    M. Fischetti, M. Monaci, “Light Robustness”, in R.K. Ahuja, R. Moehring, C. Zaroliagis, Eds., Robust and Online Large-Scale Optimization, Lecture Notes in Computer Science 5868, Springer-Verlag, Berlin Heidelberg, 61-84, 2009.
85. [85]
    M. Fischetti, D. Salvagnin, “Feasibility Pump 2.0”, Mathematical Programming Computation, 1, 201-222, 2009.
86. [86]
    M. Fischetti, A. Lodi, D. Salvagnin, “Just MIP it!”, in V. Maniezzo, T. Stautzle, S. Voss, Eds., Matheuristics: Hybridizing Metaheuristics and Mathematical Programming, Annals of Information Systems 10, 39-70, 2009.
87. [87]
    M. Fischetti, D. Salvagnin, “Pruning moves”, INFORMS Journal on Computing 22(1), 108-119, 2010.
88. [88]
    E. Balas, M. Fischetti, A. Zanette, “On the enumerative nature of Gomory's dual cutting plane method”, Mathematical Programming B, 125, 325-351, 2010.
89. [89]
    M. Fischetti, D. Salvagnin, A. Zanette, “A note on the selection of Benders' cuts”, Mathematical Programming B, 124, 175-182, 2010.
90. [90]
    M. Fischetti, A. Lodi, “On the knapsack closure of 0-1 Integer Linear Programs”, Electronic Notes in Discrete Mathematics, 36, 799-804, 2010.
91. [91]
    M. Fischetti, D. Salvagnin, “An in-out approach to disjunctive optimization”, CPAIOR, Lecture Notes in Computer Science, Vol. 6140, 136-140, 2010.
92. [92]
    M. Fischetti, A. Lodi, “Heuristics in Mixed Integer Programming” , Wiley Encyclopedia of Operations Research and Management Science (James J. Cochran ed.), John Wiley & Sons, Vol. 8, 738-747, 2011.
93. [93]
    M. Fischetti, A. Lodi, A. Tramontani, “On the separation of disjunctive cuts”, Mathematical Programming A, 128 (1-2), 205-230, 2011.
94. [94]
    A. Zanette, M. Fischetti, E. Balas, “Lexicography and degeneracy: can a pure cutting plane algorithm work?”, Mathematical Programming A, 130, 153-176, 2011.
95. [95]
    M. Fischetti, D. Salvagnin, “A relax-and-cut framework for Gomory's mixed integer cuts”, Mathematical Programming Computation, 3, 79-102, 2011.
96. [96]
    E. Balas, M. Fischetti, A. Zanette, “A hard integer program made easy by lexicography”, Mathematical Programming A, 135 (1), 509-514, 2012.
97. [97]
    V. Cacchiani, A. Caprara, M. Fischetti, “A Lagrangian heuristic for robustness, with an application to train timetabling”, Transportation Science 46 (1), 124-133, 2012.
98. [98]
    M. Fischetti, M. Monaci, “Branching on nonchimerical fractionalities”, Operations Research Letters 40, 159-164, 2012.
99. [99]
    M. Fischetti, M. Monaci, D. Salvagnin, “Three ideas for the Quadratic Assignment Problem”, Operations Research 60 (4), 954-964, 2012.
100. [100]
     M. Fischetti, M. Monaci, “Cutting plane versus compact formulations for uncertain (integer) linear programs”, Mathematical Programming Computation 4 (3), 239-273, 2012.
101. [101]
     M. Fischetti, L. Liberti, “Orbital shrinking”, Lecture Notes in Computer Science, Vol. 7422, 48-58, 2012.
102. [102]
     M. Fischetti, D. Salvagnin, “Approximating the split closure”, INFORMS Journal on Computing, 1-11, 2013.
103. [103]
     M. Fischetti, M. Monaci, “Backdoor branching”, INFORMS Journal on Computing 25 (4), 693-700, 2013.
104. [104]
     M. Fischetti, M. Monaci, “Exploiting erraticism in search”, Operations Research 62 (1), 114-122, 2014.
105. [105]
     N.L. Boland, A.C. Eberhard, F. G. Engineer, M. Fischetti, M.W.P. Savelsbergh, A.Tsoukalas, “Boosting the Feasibility Pump”, Matematical Programming Computation (6) 255-279, 2014.
106. [106]
     M. Fischetti, M. Monaci, D. Salvagnin, “Self-splitting of workload in parallel computation”, Integration of AI and OR Techniques in Constraint Programming (CPAIOR), Lecture Notes in Computer Science, Volume 8451, 394-404, 2014.
107. [107]
     M. Fischetti, M. Monaci, “Proximity Search for 0-1 Mixed-Integer Convex Programming”, Journal of Heuristics 20 (6), 709-731, 2014.
108. [108]
     M. Fischetti, G. Sartor, A. Zanette, “A MIP-and-refine matheuristic for smart grid energy management”, International Transactions in Operational Research 22 (1), 49-59, 2015.
109. [109]
     M. Fischetti, M. Fischetti, M. Monaci, “Optimal Turbine Allocation for Offshore and Onshore Wind Farms”, in Optimization in the Real World: Toward Solving Real-World Optimization Problems (K. Fujisawa, Y. Shinano, H. Waki eds.), Vol. 13, pp. 55-78, ISBN 978-4-431-55419-6, Springer Japan, 2015.
110. [110]
     M. Fischetti, “Fast training of Support Vector Machines with Gaussian kernel”, Discrete Optimization 22, 183-194, 2016.
111. [111]
     M. Fischetti, M. Monaci, D. Salvagnin, “Mixed-Integer Linear Programming Heuristics for the PrePack Optimization Problem”, Discrete Optimization 22, 195-205, 2016.
112. [112]
     M. Fischetti, A. Lodi, M. Monaci, D. Salvagnin, A. Tramontani, “Improving Branch-and-Cut Performance by Random Sampling”, Mathematical Programming Computation (8) 113-132, 2016.
113. [113]
     N. Boland, M. Fischetti, M. Monaci, M. Savelsbergh, “Proximity Benders: a decomposition heuristic for Stochastic Programs”, Journal of Heuristics 22(2), 181-198, 2016.
114. [114]
     M. Fischetti, I. Ljubic, M. Monaci, M. Sinnl, “Intersection cuts for bilevel optimization”, in Integer Programming and Combinatorial Optimization: 18th International Conference, IPCO 2016, Liege, Belgium, June 1-3, 2016, Proceedings (Q. Louveaux and M. Skutella ed.s), Volume 9682 of the series Lecture Notes in Computer Science, Springer International Publishing, 77-88, 2016.
115. [115]
     M. Fischetti, I. Ljubic, M. Sinnl, “Benders decomposition without separability: a computational study for capacitated facility location problems”, European Journal of Operational Research, 253, 557-569, 2016.
116. [116]
     P. Belotti, P. Bonami, M. Fischetti, A. Lodi, M. Monaci, A. Nogales-Gomez, D.Salvagnin, “On handling indicator constraints in mixed integer programming”, Computational Optimization and Applications, 65, 545-566, 2016.
117. [117]
     M. Fischetti, I. Ljubic, M. Sinnl, “Redesigning Benders Decomposition for Large Scale Facility Location”, Management Science 63 (7), 2146-2162, 2017.
118. [118]
     E. Balas, M. Fischetti, “Integer (Linear) Optimization”, in Advances and Trends in Optimization with Engineering Applications, T. Terlaky, M. F. Anjos, and S. Ahmed (editors), MOS-SIAM Book Series on Optimization, SIAM, Philadelphia, 2017.
119. [119]
     M. Fischetti, L. Liberti, D. Salvagnin, T. Walsh, “Orbital shrinking: theory and applications”, Discrete Applied Mathematics 222, 109-123, 2017.
120. [120]
     M. Fischetti, M. Leitner, I. Ljubic, M. Luipersbeck, M. Monaci, M. Resch, D. Salvagnin, M. Sinnl, “Thinning out Steiner trees: a node-based model for uniform edge costs”, Mathematical Programming Computation 9, 203-229, 2017 (award winner at DIMACS11).
121. [121]
     M. Fischetti, M. Monaci, “Using a general-purpose MILP solver for the practical solution of real-time train rescheduling”, European Journal of Operational Research 263, 1, 258-264, 2017.
122. [122]
     M. Fischetti, I. Ljubic, M. Monaci, M. Sinnl, “A new general-purpose algorithm for mixed-integer bilevel linear programs”, Operations Research 65(6), 1615-1637, 2017.
123. [123]
     M. Fischetti, M. Monaci, D. Salvagnin, “Self-split parallelization for Mixed Integer Linear Programming”, Computers and Operations Research 93, 101-112, 2018.
124. [124]
     M. Fischetti, J. Jo, “Deep neural networks and mixed integer linear optimization”, Constraints 23(3), 296-309, 2018.
125. [124bis]
     M. Fischetti, J. Jo, “Deep Neural Networks as 0-1 Mixed Integer Linear Programs: A Feasibility Study”, CPAIOR 2018 proceedings (W.-J. van Hoeve ed.), LNCS 10848, Springer International, page XX, 2018 (preliminary version of [124]).
126. [125]
     M. Fischetti, D. Salvagnin, “Chasing first queens by integer programming”, CPAIOR 2018 proceedings (W.-J. van Hoeve ed.), LNCS 10848, Springer International, 232-244, 2018.
127. [126]
     M. Fischetti, M. Kahr, M. Leitner, M. Monaci, M. Ruthmair, “Least cost influence propagation in (social) networks”, Mathematical Programming 170, 293-325, 2018.
128. [127]
     M. Fischetti, M. Monaci, M. Sinnl, “A dynamic reformulation heuristic for Generalized Interdiction Problems”, European Journal of Operational Research 267(1), 40-51, 2018.
129. [128]
     S. Brigadoi, D. Salvagnin, M. Fischetti, R. Cooper, “Array Designer: Automated optimized array design for functional near-infrared spectroscopy”, Neurophotonics 5(3), 035010 Jul-Sep 2018, doi: 10.1117/1.NPh.5.3.035010
130. [129]
     M. Fischetti, I. Ljubic, M. Monaci, M. Sinnl, “On the use of intersection cuts for bilevel optimization”, Mathematical Programming 172(1), 77-103, 2018,
131. [130]
     M. Fischetti, I. Ljubic, M. Monaci, M. Sinnl, “Interdiction Games and Monotonicity, with Application to Knapsack Problems”, INFORMS Journal on Computing 31(2), 390-410, 2019.
132. [131]
     M. Fischetti, M. Monaci, “A Branch-and-Cut Algorithm for Mixed-Integer Bilinear Programming”, European Journal of Operational Research 282, 506-514, 2020 (doi: 10.1016/j.ejor.2019.09.043)
133. [132]
     D. Cazzaro, M. Fischetti, M. Fischetti, “Heuristic Algorithms for the Wind Farm Cable Routing Problem”, Applied Energy 278, 115617, 2020 (doi: 10.1016/j.apenergy.2020.115617)
134. [133]
     M. Fischetti, M. Stringher, “Embedding Simulated Annealing within Stochastic Gradient Descent”, Communications in Computer and Information Science, 2021, 1443, pp. 3-13, 2021 (doi: 10.1007/978-3-030-85672-4_1)
135. [134]
     F. Cavaliere, E. Bendotti, M. Fischetti, “An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem”, Mathematical Programming Computation 14, 749-779, 2022 (doi: 10.1007/s12532-022-00224-2)
136. [135]
     D. Liu, M. Fischetti, A. Lodi, “Learning to Search in Local Branching”, Proceedings of the AAAI Conference on Artificial Intelligence, 36(4), 3796-3803, 2022 (doi: 10.1609/aaai.v36i4.20294 -- arXiv preprint arXiv:2112.02195)
137. [136]
     M. Fischetti, M. Fischetti, “Integrated layout and cable routing in wind farm optimal design”, Management Science, 2022 (doi: 10.1287/mnsc.2022.4470).
138. [137]
     M. Fischetti, M. Fischetti, J. Stoustrup, “Safe distancing in the time of COVID-19”, European Journal of Operational Research, 304(1), 139-149, 2023 (doi: 10.1016/j.ejor.2021.07.010).
139. [138]
     D. Salvagnin, R. Roberti, M. Fischetti, “A fix-propagate-repair heuristic for Mixed Integer Programming”, Mathematical Programming Computation, 1-29, 2024 (doi: 10.1007/s12532-024-00269-5).
140. [139]
     M. Fischetti, M., Fischetti, M., “Matheuristics by Examples”, In: Marti', R., Pardalos, P.M., Resende, M.G. (eds), Handbook of Heuristics, 1-35, Springer, Cham, 2025 (doi: 10.1007/978-3-319-07153-4_14-2).
141. [140]
     R. Roberti, D. Salvagnin, M. Fischetti, “An improved compact formulation for the assortment optimization problem with small consideration sets”, Journal of the Operational Research Society, 1-11, 2025 (doi: 10.1080/01605682.2025.2451738).
142. [141]
     D. Palasgo, M. Fischetti, R. Roberti, “Column Generation Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-out Loading”, In: M. Barbato et al. (eds), Beyond Frontiers of Operations Research: Emerging Technologies and Innovative Optimization Paradigms, AIRO Springer Series 14, 75-86, Springer, 2025 (doi: 10.1007/978-3-031-85894-9_6)
143. [142]
     F. Cavaliere, M. Fischetti, R. Roberti, D. Salvagnin, “Models and Algorithms for the Time Window Assignment Traveling Salesperson Problem with Stochastic Travel Times”, European Journal of Operational Research 329(1), 96-111, 2026 (doi: 10.1016/j.ejor.2025.07.034)

No publication matches your search.