Papers

 International Journal Papers
  1. L. Gouveia, M. G. Scutellà "Editorial", Networks, 59 (1), 1 - 2, 2012

  2. P. Cappanera, M. G. Scutellà "Color-Coding Algorithms to the Balanced Path Problem: Computational Issues" (with related Online Supplement), INFORMS Journal on Computing, 23 (3), 446 - 459, 2011 (previously published online in Articles in Advance, August 31, 2010)

  3. D. Cherubini, A. Fanni, A. Frangioni, A. Mereu, C. Murgia, M.G. Scutellà, P. Zuddas "A Linear Programming Model for Traffic Engineering in 100% Survivable Networks under combined IS-IS/OSPF and MPLS-TE Protocols", Computers & Operations Research, 38 (12), 1805 - 1815, 2011

  4. A. Frangioni, F. Pascali, M.G. Scutellà "Static and dynamic routing under disjoint dominant extreme demands", Operations Research Letters, 39 (1), 2011

  5. R. Recchia, M.G. Scutellà "Robust portfolio asset allocation and risk measures", Invited Survey, 4OR, 8 (2), 113 - 139, 2010

  6. M.G. Scutellà "On improving optimal oblivious routing", Operations Research Letters, 37 (3), 197 - 200, 2009

  7. D. Ambrosino, A. Sciomachen, M.G. Scutellà "A heuristic approach based on multi-exchange techniques for a regional fleet assignment location-routing problem", Computers & Operations Research, 36 (2), 442 - 460, Scheduling for Modern Manufacturing, Logistics, and Supply Chains, 2009

  8. M.G. Scutellà "The maximum congested cut problem and its robust counterpart: exact and approximation algorithms for the single and the multicommodity case", Networks, 51 (2), 102 - 112, 2008

  9. G. Gallo, M.G. Scutellà "Foreword (dedicated to the memory of Stefano Pallottino)", Networks, 51 (1), 1 - 3, 2008

  10. C. Chekuri, G. Oriolo, M.G. Scutellà, F.B. Shepherd "Hardness of Robust Network Design", Networks, 50 (1), 50 - 54, 2007

  11. M. G. Scutellà "A note on the parametric maximum flow problem and some related reoptimization issues", Arbib, Rossi and Smriglio (Eds.), Annals of Operations Research. Combinatorial Optimization and Application In Memory of Mario Lucertini, 150, 231 - 244, 2007

  12. P. Cappanera, M. G. Scutellà "Balanced paths in acyclic networks: tractable cases and related approaches", Networks, 45 (2), 104 - 111, 2005

  13. D. Ambrosino and M.G. Scutellà "Distribution network design: new problems and related models", European Journal of Operational Research, 165 (3), 610 - 624, 2005

  14. S. Pallottino, M. P. Scaparra and M. G. Scutellà "Large scale local search heuristics for the Capacitated Vertex p-Center Problem", Networks, 43 (4), 241 - 255, 2004

  15. R. K. Ahuja, J. B. Orlin, S. Pallottino, M. P. Scaparra and M. G. Scutellà "A multi-exchange heuristic for the single source capacitated facility location problem", Management Science, 50 (6), 749 - 760, 2004

  16. A. Frangioni, M.G. Scutellà, E. Necciari "A Multi-exchange Neighborhood for Minimum Makespan Machine Scheduling Problems", Journal of Combinatorial Optimization, 8 (2), 195 - 220, 2004

  17. R. K. Ahuja, J. B. Orlin, S. Pallottino, M.G. Scutellà "Dynamic Shortest Paths Minimizing Travel Times and Costs", Networks, 41, 197 - 205, 2003

  18. S. Pallottino, M.G. Scutellà "A new algorithm for reoptimizing shortest paths when the arc costs change", Operations Research Letters, 31 (2), 2003

  19. M.G. Scutellà "An approximation algorithm for computing longest paths", EJOR 148(3), 584 - 590, 2003

  20. G. Gallo, M.G. Scutellà "A note on Minimum Makespan Assembly Plans", EJOR 142, 309 - 320, 2002

  21. R. K. Ahuja, J. B. Orlin, S. Pallottino, M.G. Scutellà "Minimum time and minimum cost path problems in street networks with traffic lights", Transportation Science 36(3), 326 - 336, 2002

  22. M.G. Scutellà "A strongly polynomial algorithm for the Uniform Balanced Network Flow Problem" Discrete Applied Mathematics 81, p. 123 - 131, 1998 (included in Discrete Applied Mathematics - Editors' Choice, 1998)

  23. R. Cambini, G. Gallo, M.G. Scutellà "Flows on Hypergraphs" Mathematical Programming 78, 195 - 217, 1997

  24. S. Pallottino, M.G. Scutellà "Dual algorithms for the shortest path tree problem" Networks 29, 125 - 133, 1997

  25. D.P. Bertsekas, S. Pallottino, M.G. Scutellà "Polynomial Auction algorithms for shortest paths" Computational Optimization and Applications 4(2), 99 - 125, 1995

  26. G. Gallo, M.G. Scutellà "Toward a programming environment for combinatorial optimization: a case study oriented to max-flow computations" ORSA Journal on Computing 5, 120 - 133, 1993

  27. G. Mazzoni, S. Pallottino, M.G. Scutellà "The maximum flow problem: a max-preflow approach" European Journal of Operational Research 53, 257 - 278, 1991

  28. M.G. Scutellà "A note on Dowling-Gallier's Top-Down algorithm for Propositional Horn Satisfiability" Journal of Logic Programming 8, 265 - 273, 1990

  29. G. Gallo, M.G. Scutellà "Polynomially solvable satisfiability problems" Information Processing Letters 29 221 - 227, 1988 

    30.  Scientific Books and Edited Proceedings

  30. L. Gouveia, M. G. Scutellà (Eds.) "Special Issue on the INOC 2009 Conference, April 26 - 29, 2009, Pisa, Italy", Special issue of Networks , 59 (1), 1 - 189, 2012

  31. G. Gallo, M. G. Scutellà (Eds.) "Special Issue In Memory of Stefano Pallottino", Special issue of Networks , 51 (1), 2008

  32. G. Bigi, A. Frangioni, M. G. Scutellà (Eds.) "Proceedings of INOC 2009", Pisa, Italy, 2009

    33.  Book Chapters

  33. P. Cappanera, L. Gouveia, M.G. Scutellà "The Skill Vehicle Routing Problem", J. Pahl, T. Reiners and S. Voss (Eds.), Network Optimization. 5th International Conference, INOC 2011. Hamburg, Germany, June 2011, Lecture Notes in Computer Science, LNCS 6701, Springer-Verlag Berlin Heidelberg, 354 - 364, 2011

  34. F. Pascali, M.G. Scutellà "Ottimizzazione Robusta", a cura di G. Ghiani and R. Musmanno, Modelli e metodi decisionali in condizioni di incertezza e rischio, McGraw-Hill, 2009

  35. M.G. Scutellà "Teoria e Metodi di Riottimizzazione per Problemi di Flusso", Atti della Scuola CIRO 2002, A. Agnetis and G. Di Pillo (Eds.), 441 - 472, Pitagora Editrice, 2003

  36. S. Nguyen, S. Pallottino and M.G. Scutellà "A new dual algorithm for shortest path reoptimization", M. Gendreau and P. Marcotte (Eds.), Transportation and Nework Analysis: Current Trends, Kluwer Academic Publishers, 221 - 235, 2002

  37. S. Pallottino, M.G. Scutellà "Shortest path algorithms in transportation models: classical and innovative aspects", P. Marcotte and S. Nguyen (Eds.), Equilibrium and Advanced Transportation Modelling, Kluwer Academic Publishers, 245 - 281, 1998

    38.  Proceedings of International conferences (refereed)

  38. R.G. Garroppo, S. Giordano, G. Nencioni, M.G. Scutellà "Network Power Management: models and heuristic approaches", IEEE GLOBECOM 2011, Houston, 2011

  39. G. Nencioni, R.G. Garroppo, S. Giordano, M.G. Scutellà "Power Aware Routing and Network Design with Bundled Links", Proceedings of GTTI 2011, Messina (Italy), 2011

  40. A. Frangioni, F. Pascali, M.G. Scutellà "Chance constrained network design", Proceedings of INOC 2009, G. Bigi, A. Frangioni, M.G. Scutellà (Eds.), paper TC2-2, Pisa (Italy), 2009

  41. P. Cappanera, M.G. Scutellà "Balanced paths in telecommunication networks: some computational results", Proceedings of INOC 2007, Spa (Belgium), 2007

  42. P. Cappanera, G. De Pascale, M. G. Scutellà "Color-coding heuristic approaches for the balanced path problem", Proceedings of Odysseus 2006, Third International Workshop on Freight Transportation and Logistics , Benavent, Campos, Corberan, Marti, Mota, Plana and Sanchis (Eds.), Altea (Spain), 92 - 97, 2006

  43. C. Chekuri, G.P.Oriolo, M.G.Scutellà, F.B.Shepherd "Hardness of Robust Network Design", Proceedings of INOC 2005, Book 2, Gouveia e Mourao (Eds.), Lisbon, 455 - 461, 2005

  44. M.G. Scutellà "The maximum cut congestion problem", Proceedings of INOC 2005, Book 3, Gouveia e Mourao (Eds.), Lisbon, 670 - 673, 2005

  45. M.G. Scutellà "A note on the parametric maximum flow problems and some related reoptimization issues", Proceedings of INOC 2003, Evry (Paris), 516 - 520, 2003

  46. I. Chabini, A. Glenn, S. Pallottino, M.G. Scutellà Reoptimization algorithms for minimum-time path problems in dynamic networks, Proceedings of Transportation Research Board Annual Meeting, 2002

    47.  Italian Journal Papers (refereeed)

  47. G. Gallo, M.G. Scutellà "Directed Hypergraphs as a Modelling Paradigm", Rivista AMASES 21, 97 - 123,1998

  48. G. Gallo, F. Licheri, M.G. Scutellà "The Hypergraph Simplex Approach: some experimental results" Ricerca Operativa 78, 21 - 54, 1996

  49. M. Gambale, M. Nonato, M.G. Scutellà "The Cutting Stock Problem: a new model based on hypergraph flows" Ricerca Operativa anno XXV, 74, 1995

  50. S. Pallottino, M.G. Scutellà "Strongly polynomial auction algorithms for shortest paths" Ricerca Operativa 60, 33 - 53, 1991

  51. M.G. Scutellà "A note on Cherkasky's algorithm for the maximum flow problem" Ricerca Operativa 53, 65 - 75, 1990

  52. M.G. Scutellà, G. Scevola "A modification of Lipski-Preparata's algorithm for the maximum matching problem on bipartite convex graphs" Ricerca Operativa 46, 63 - 77, 1988 

    53.  Ph.D. Thesis

  53. M.G. Scutellà "A unified algorithmic framework for Max-Flow computations (Toward the design of a combinatorial optimization programming environment)" Ph.D. Dissertation TD 1/90, Dip. di Informatica, Univ. di Pisa, 1990 

    54.  Book Review

  54. S. Pallottino, M.G. Scutellà, review of "Annotated Bibliographies in Combinatorial Optimization" (Dell'Amico, Maffioli, Martello Eds.) Ricerca Operativa anno XXVII, 84, 63 - 68, 1997

    55.  Technical Reports and submitted papers

  55. M.G. Scutellà "A note on the hardness of some optimal oblivious routing generalizations", Dipartimento di Informatica, Università di Pisa, 2012 (submitted)

  56. P. Cappanera, L. Gouveia, M.G. Scutellà "Models and valid inequalities to Skill-Based Routing Problems" , CIO - Working Paper 8/2011, Operations Research Center, Faculty of Sciences, University of Lisbon, 2011 (submitted)

  57. R.G. Garroppo, S. Giordano, G. Nencioni, M.G. Scutellà "Mixed integer nonlinear programming models for Green Network Design", Dipartimento di Informatica, Università di Pisa, 2011 (submitted)

  58. M.G. Scutellà "Hardness of some optimal oblivious routing generalizations" , TR 10-05, Dipartimento di Informatica, Università di Pisa, 2010

  59. R. Recchia, M.G. Scutellà "Experiments with robust asset allocation strategies: classical versus relaxed robustness" , TR 10-04, Dipartimento di Informatica, Università di Pisa, 2010 (submitted)

  60. A. Frangioni, F. Pascali, M.G. Scutellà "Static and dynamic routing under the single-source Hose model" , TR 09-23, Dipartimento di Informatica, Università di Pisa, 2009

  61. R. Recchia, M.G. Scutellà "Robust Portfolio Asset Allocation: models and algorithmic approaches" , TR 09-01, Dipartimento di Informatica, Università di Pisa, 2009

  62. D. Cherubini, A. Fanni, A. Frangioni, C. Murgia, M.G. Scutellà, P. Zuddas "A Linear Programming Model for Traffic Engineering in 100% Survivable Networks under combined IS-IS/OSPF and MPLS-TE Protocols" , TR 08-24, Dipartimento di Informatica, Università di Pisa, 2008

  63. P. Cappanera, M.G. Scutellà "Color-coding algorithms to the balanced path problem: computational issues", TR 07-08, Dipartimento di Informatica, Università di Pisa, 2007

  64. D. Ambrosino, A. Sciomachen, M.G. Scutellà "A heuristic approach based on multi-exchange techniques for a regional location-routing problem", TR 23, Dipartimento di Economia e Metodi Quantitativi (DIEM), Università di Genova, 2004

  65. M.P.Scaparra, M.G. Scutellà "Facilities, Locations, Customers: Building blocks of location models. A survey", TR 01-18, Dipartimento di Informatica, Università di Pisa, 2001

  66. D. Ambrosino, M.G. Scutellà "Distribution network design: new problems and related models", TR 01-05, Dip. di Informatica, Univ. di Pisa, 2001

  67. A. Frangioni, E. Necciari, M.G. Scutellà "Multi-exchange algorithms for the minimum makespan machine scheduling problem", TR 99-22, Dip. di Informatica, Univ. di Pisa, 1999

  68. A. Frangioni, D. Pretolani, M.G. Scutellà "Fast Lower Bounds for the Capacitated Minimum Spanning Tree Problem", TR 05/99, 1999

  69. B. Klinz, M.G. Scutellà "A strongly polynomial algorithm for the Balanced network flow problem", TR 99-17, Dip. di Informatica, Univ. di Pisa, 1999

    70.  Didactic Books

  70. G. Bigi, A. Frangioni, G. Gallo, S. Pallottino, M.G. Scutellà "Appunti di Ricerca Operativa", Dip. di Informatica, Univ. di Pisa, 2006