Curriculum  vitae  of 

 

 

 

 

Address

 

CV:                  http://www.dei.unipd.it/~fisch

reports:             http://www.dei.unipd.it/~fisch/papers

slides:               http://www.dei.unipd.it/~fisch/papers/slides

teaching:           http://www.dei.unipd.it/~fisch/ricop

dissertations:     http://www.dei.unipd.it/~fisch/ricop/tesi

 

 

 

 

Personal

 

Born in 1958. Italian. Married. One daughter.

 

 

     Education

 

University of Bologna, “Laurea in Ingegneria Elettronica” 100/100 cum laude (1982)

 

University of Bologna, PhD degree “Dottorato di Ricerca in Ingegneria dei Sistemi” (1987)

 

Professional Experience

 

Assistant Professor in “Operations Research” Dipartimento di Elettronica, Informatica e Sistemistica, University of Bologna (1990-1992)

 

Associate Professor in “Operations Research” Dipartimento di Elettronica ed Informatica, University of Padova (1992-1994)

 

Full Professor in “Operations Research” Dipartimento di Ingegneria Elettrica, University of L’Aquila  (1994-1995), Dipartimento di Matematica ed Informatica, University of Udine (1995-1997), and Dipartimento di Elettronica ed Informatica, University of Padova (1997-)

 

Research Interests

 

Mixed Integer Programming, Combinatorial Optimization, Vehicle Routing and Scheduling Problems,  Graph Theory, Design and Analysis of Combinatorial Algorithms, Polyhedral Combinatorics, 2-D Nesting Problems.

 

Professional Activities

 

Member of the Editorial Board of the international journals  “Mathematical Programming Computation”, “Journal of Combinatorial Optimization”, and “4OR”

Plenary speaker at Mathematical Programming Symposium, Chicago, August 2009

Chair of the international Program Committee for the meeting “Integer Programming and Combinatorial Optimization", 2007

Plenary speaker at the EuroGP2005 & EvoCOP2005 meeting, Lausanne, March 2005.

Semiplenary speaker at the Mathematical Programming Symposium, Lausanne, July 1997

Member of the international Program Committee for the meeting “Integer Programming and Combinatorial Optimization” Copenhagen, May 1995

Plenary speaker at the 1st Nordic Optimization Symposium, Copenhagen, April 2006

Semiplenary speaker at the SOR '99 meeting, Magdeburg, September 1999

Chair of the international Program Committee for the meeting “ATMOS 2008”

Member of the Program Committee for the meeting ATMOS 2007

Invited speaker at the University of Pittsburgh, New York, Augsburg, Berlin, Copenhagen, Tenerife, Milano, Pisa, Torino, Roma, etc.

Invited speaker in International Meetings (Oberwolfach, Aussois, Mathematical Programming Symposium, IPCO, ORSA/TIMS, EURO, ...)

Member of M.P.S. (the Mathematical Programming Society) and of A.I.R.O. (the Italian Operations Research society)

Consultant for Optimization Problems and Applications (World Bank, Ferrovie dello Stato, Agip-Petroli, Sogesta, Ars-Enidata, Rasimelli e Coletti, Sisplan, ...)

Research Projects supported by MURST/MIUR, Italy (“Teoria degli Algoritmi”, “Progetto e Analisi di Algoritmi”, “Algoritmi e Strutture di Calcolo”, “Automazione dei Sistemi Flessibli di Produzione”, “Modelli ed Algoritmi per l'Ottimizzazione”, “Metodi di Ottimizzazione delle Decisioni”, “Problemi di circuiti ottimi su reti”,  “Integrazione tra Programmazione Lineare Intera e Programmazione a Vincoli”,  “Modelli ed algoritmi per l'ottimizzazione robusta delle reti”, ...)

Research Project “Parallel Algorithms for Network Flow Problems” supported by N.A.T.O.

Research Projects “Progetto Finalizzato Trasporti I and II” supported by C.N.R., Italy

Research Project “ALPI” supported by FS-Ferrovie dello Stato, Italy (1993-1996)

Research Project “FASTER” supported by FS-Ferrovie dello Stato, Italy (1994-1997)

Research Project “FARO” supported by FS-Ferrovie dello Stato, Italy (1995-1998)

Research Project “SDC” supported by the Esprit programme, European Union (1995-1997)

Research Project “Europe-TRIS” supported by the Telematics Applications Programme, European Union (1995-1998)

Research Project “Europe-TRIO” supported by the Telematics Applications Programme, European Union (1997-1999)

Research Project “CASC” supported by the European Union (2000-2004)

Research Project “ARRIVAL” supported by the European Union (2005-2008)

                  ...

 

Prizes

 

 First Prize “Best Young Researcher” awarded by  A.I.R.O. (the Italian Operations Research Society), 1987

 

 First International Prize “Best Ph.D. Dissertation on Transportation” awarded by the Operations Research Society of America (the first prize awarded by O.R.S.A. for a Ph.D. thesis developed outside U.S.A.), 1987

 

 First Prize “FASTER” awarded by FS-Ferrovie dello Stato for the best computer code for solving very large set-covering problems arising in railway scheduling (jointly with A. Caprara and P. Toth), 1994

 

 First Prize “FARO” awarded by FS-Ferrovie dello Stato for the best computer code for solving a bus-driver scheduling problem arising in railway applications (jointly with A. Caprara, P. Toth and D. Vigo), 1995

 

Finalist of  the INFORMS “Daniel H. Wagner Prize for Excellence in Operations Research Practice” with the paper  “Reinventing Crew Scheduling at Netherlands Railways (jointly with Erwin Abbink, Leo Kroon, Gerrit Timmer, and Michiel Vromans), 2004

 

Winner of  the 2008 INFORMS Edelman award (the Oscar for OR practice)  for the entry “The New Dutch Timetable: The O.R. Revolution” (jointly with the Netherlands Railways team: Leo Kroon, Dennis Huisman, Erwin Abbink, Pieter-Jan Fioole, Gabor Maroti, Lex Schrijver, Adri Steenbeek, Roelof Ybema), 2008 [YouTube video]

 

 

 

 

Publications

 

 

[1] M. Fischetti, “Worst-Case Analysis of an Approximation Scheme for the Subset-Sum Problem” Operations Research Letters 6, 283-284, 1986.

 

[2] M. Fischetti, S. Martello, P. Toth, “The Fixed Job Schedule Problem with Spread-Time Constraints” Operations Research 35, 849-858, 1987.

 

[3] M. Fischetti, S. Martello, “Worst-Case Analysis of the Differencing Method for the Partition Problem”  Mathematical Programming A 37, 117-120, 1987.

 

[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] 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] M. Fischetti,  P. Toth, “A New Dominance Procedure for Combinatorial Optimization Problems”  Operations Research Letters 7, 181-187, 1988.

 

[7] M. Fischetti, S. Martello, P. Toth, “The Fixed Job Schedule Problem with Working-Time Constraints” Operations Research 37, 395-403, 1989.

 

[8] M. Fischetti, P. Toth, “An Additive Bounding Procedure for Combinatorial Optimization Problems” Operations Research 37, 319-328, 1989.

 

[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] G. Carpaneto, M. Fischetti,  P. Toth, “New Lower Bounds for the Symmetric Travelling Salesman Problem” Mathematical Programming B 45, 233-254, 1989.

 

[11] M. Fischetti, “A New Linear Storage, Polynomial-Time Approximation Scheme for the Subset-Sum Problem” Discrete Applied Mathematics 26, 61-77, 1990.

 

[12] M. Fischetti, “Facets of the Asymmetric Traveling Salesman Polytope” Mathematics of Operations Research 16, 42-56, 1991.

 

[13] M. Fischetti, “Facets of Two Steiner Arborescence Polyhedra” Mathematical Programming A 51, 401-419, 1991.

 

[14] M. Fischetti,  P. Toth, “An Additive Bounding Procedure for the Asymmetric Travelling Salesman Problem” Mathematical Programming A 53, 173-197, 1992.

 

[15] M. Fischetti, S. Martello, P. Toth, “Approximate Algorithms for Fixed Job Schedule Problems”  Operations Research 40, S96-S108, 1992.

 

[16] E. Balas, M. Fischetti, “The Fixed Out-Degree 1-Arborescence Polytope” Mathematics of Operations Research 17, 1001-1018, 1992.

 

[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] M. Dell'Amico, M. Fischetti, P. Toth, “Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem” Management Science 39, 115-125, 1993.

 

[19] M. Fischetti, G. Laporte, S. Martello, “The Delivery Man Problem and Cumulative Matroids” Operations Research 41, 1055-1064, 1993.

 

[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] M. Fischetti, P. Toth, “An Efficient Algorithm for the Min-Sum Arborescence Problem” ORSA Journal on Computing 5, 426-434, 1993.

 

[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] M. Fischetti, H.W. Hamacher, K. Joernsten, F. Maffioli, “k -Cardinality Trees: Complexity and Polyhedral Structure” Networks  24, 11-21, 1994.

 

[24] M. Fischetti, “Clique Tree Inequalities Define Facets of the Asymmetric Traveling Salesman Polytope” Discrete Applied Mathematics 56, 9-18, 1995.

 

[25] E. Balas, M. Fischetti, W.R. Pulleyblank, “The Precedence-Constrained Asymmetric Traveling Salesman Polytope” Mathematical Programming A, 68, 241-265, 1995.

 

[26] M. Fischetti, J.J. Salazar, P. Toth, “The Symmetric Generalized Travelling Salesman Polytope” Networks , 26/2, 113-123, 1995.

 

[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] A. Caprara, M. Fischetti, “0-1/2 Chvatal-Gomory Cuts” Mathematical Programming A, 74, 221-235, 1996.

 

[29] A. Caprara, M. Fischetti, “Odd Cut-sets, Odd Cycles, and 0-1/2 Chvatal-Gomory Cuts”, Ricerca Operativa, 26, 51-80, 1996.

 

[30] M. Fischetti, D. Vigo, “A Branch-and-Cut Algorithm for the Resource-Constrained Arborescence Problem” Networks 29, 55-67, 1997.

 

[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] A. Caprara, M. Fischetti, P. Toth, D. Vigo, P.L. Guida, “Algorithms for Railway Crew Management” Mathematical Programming B 79, 125-141, 1997.

 

[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] E. Balas, M. Fischetti, “On the Monotonization of Polyhedra” Mathematical Programming A  78, 59-84, 1997.

 

[35] M. Fischetti, P. Toth, “A Polyhedral Approach to the Asymmetric Traveling Salesman Problem” Management Science 43, 11, 1520-1536, 1997.

 

[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] 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] A. Caprara, M. Fischetti, P. Toth, D. Vigo, “Models and Algorithms for the Crew Rostering” Operations Research 46, 6, 820-830, 1998.

 

[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] E. Balas, M. Fischetti, “Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem” Mathematics of Operations Research 24, 2, 273-292, 1999.

 

[41] A. Caprara, M. Fischetti, P. Toth, “A Heuristic Method for the Set Covering Problem” Operations Research 47, 5, 730-743, 1999.

  

[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] 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] A. Caprara, M. Fischetti, A.N. Letchford, “On the Separation of Maximally Violated Mod-k  Cuts” Mathematical Programming A 87, 37-56, 2000.

 

[45] L. Brunetta, M. Conforti, M. Fischetti, “A Polyhedral Approach to a Multicommodity Flow Problem” Discrete Applied Mathematics 101, 13-36, 2000.

 

[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] 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] 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] A. Caprara, P. Toth, M. Fischetti, “Algorithms for the Set Covering Problem” Annals of Operations Research 89, 353-371, 2000.

 

[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] M. Fischetti, J.J. Salazar, “Solving the Cell Suppression Problem on Tabular Data with Linear Constraints” Management Science 47, 7, 1008-1027, 2001.

 

[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] 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] 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] 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] M. Fischetti, G. Lancia, P. Serafini, “Exact Algorithms for Minimum Routing Cost Trees”, Networks 39(3), 161-173, 2002.

 

[57] A. Caprara, M. Fischetti, P. Toth, “Modelling and Solving the Train Timetabling Problem”, Operations Research 50(5), 851-861, 2002.

 

[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] 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] 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] 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] M. Fischetti, J.J. Salazar, “Partial Cell Suppression: A new Methodology for Statistical Disclosure Control”, Statistics and Computing 13, 13-21, 2003.

[63] M. Fischetti, A. Lodi, “Local Branching”, Mathematical Programming B, 98, 23-47, 2003.

 

[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] 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] M. Fischetti, F. Glover, A. Lodi, “The Feasibility Pump”, Mathematical Programming A, 104, 91-104,  2005.

 

[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] 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] G. Codato, M. Fischetti, “Combinatorial Benders' Cuts for Mixed-Integer Linear Programming”, Operations Research 54(4), 756-766, 2006.

 

[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] M. Fischetti, C. Saturni, “Mixed-Integer Cuts from Cyclic Groups”, Mathematical Programming A, 109(1), 27-53, 2007.

 

[72] L. Bertacco, M. Fischetti, A. Lodi, “A Feasibility Pump Heuristic for General Mixed-Integer Problems”,  Discrete Optimization 4, 63-76, 2007.

 

[73] M. Fischetti, A. Lodi, “Optimizing over the first Chvàtal closure” Mathematical Programming B, 110(1), 3-20, 2007.

 

[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] M. Fischetti, A. Lodi, “MIPping closures: an instant survey”, Graphs and Combinatorics 23, 233-243, 2007. DOI) 10.1007/s00373-007-0711-62007, 2007.

 

[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] M. Fischetti, A. Lodi, “Repairing MIP infeasibility through Local Branching”, Computers and Operations Research 35, 1436-1445, 2008.

 

[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] L. Bertacco, L. Brunetta, M. Fischetti, “The Linear Ordering Problem with Cumulative Costs”, European Journal of Operational Research 189, 1345-1357, 2008.

 

[80] M. Fischetti, M. Monaci, “How tight is the corner relaxation?”, Discrete Optimization 5, 262-269, 2008.

 

[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] M. Fischetti, I. Luzzi, “Mixed-integer programming models for nesting problems”, Journal of Heuristics 15(3), 201-226, 2009. 

 

[83] M. Fischetti, D. Salvagnin, A. Zanette, “Fast approaches to impove the robustness of a railway timetable”, Transportation Science 43, 321-335, 2009.

 

[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] M. Fischetti, D. Salvagnin, “Feasibility Pump 2.0”, Mathematical Programming Computation 1, 201-222, 2009.

 

[86] A. Zanette, M. Fischetti, E. Balas, “Lexicography and degeneracy: can a pure cutting plane algorithm work?”, Mathematical Programming A, 2009; DOI 10.1007/s10107-009-0335-0

 

[87] 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.

 

[88] M. Fischetti, D. Salvagnin, “Pruning moves”, INFORMS Journal on Computing 22(1), 2009; published online in Articles in Advance, July 29, 2009; DOI: 10.1287/ijoc.1090.03292009.

 

[89] M. Fischetti, A. Lodi, A. Tramontani, “On the separation of disjunctive cuts”, Mathematical Programming A, 2009; DOI: 10.1007/s10107-009-0300-y.

 

[90] E. Balas, M. Fischetti, A. Zanette, “On the enumerative nature of Gomory's dual cutting plane method”, Mathematical Programming B, 2009 (to appear).

 

 

 

(Gomory, Pulleyblank, F.; Aussois (France), January 2008)

 

Recent technical reports (available at www.dei.unipd.it/~fisch/papers)

 

M. Fischetti, D. Salvagnin, A. Zanette, “Minimal Infeasible Subsystems and Benders' cuts”, 2008 (available here)

 

M. Fischetti, M. Monaci, “Robustness by cutting planes and the Uncertain Set Covering Problem”, 2009 (available soon)

 

M. Fischetti, D. Salvagnin, “Yoyo search”, 2009 (available soon)

 

M. Fischetti, D. Salvagnin,  “A Lagrangian framework for Gomory's cuts”, 2010 (available soon)

 

My cat (Franny)