Home page of Silvano Martello
DEI "Guglielmo Marconi", University of Bologna
Viale Risorgimento 2
40136 Bologna, Italy
 
Phone: +39 (051) 209 3022
Fax: +39 (051) 209 3073
 
Email: smartello{at}deis{dot}unibo{dot}it
Email: silvano{dot}martello{at}unibo{dot}it
 Courses
 
Bio
 
Books
 
Editor
 
Research and publications
 
Online journals
 
Special friends
 

     → free download

                        

                   

                   

Education and Academic Career:

Authored Books:

  • Il Problema dell'Assegnamento: Metodi ed Algoritmi, Consiglio Nazionale delle Ricerche, Roma, 1984 (with G. Carpaneto and P. Toth), 120 pages

  • Knapsack Problems: Algorithms and Computer Implementations, John Wiley & Sons, Chichester–New York, 1990 (with P. Toth), xii + 296 pages;
    over 6000 citations on Google Scholar (as of December 2022); free download

  • Assignment Problems, SIAM, Philadelphia, 2009 (with R. Burkard and M. Dell'Amico), xx + 382 pages

  • Assignment Problems - Revised Reprint, SIAM, Philadelphia, 2012 (with R. Burkard and M. Dell'Amico), xxii + 393 pages;
    over 1800 citations on Google Scholar (as of December 2022);

  • Ricerca Operativa per l'Economia e l'Impresa, Esculapio, Bologna, 2012 (with M.G. Speranza), x + 304 pages

  • Ricerca Operativa, Esculapio, Bologna, 2014, xii + 315 pages

Edited Books:

  • Surveys in Combinatorial Optimization, North-Holland, Amsterdam, 1987 (co-edited with G. Laporte, M. Minoux and C. Ribeiro), ix + 384 pages

  • Annotated Bibliographies in Combinatorial Optimization, John Wiley & Sons, Chichester–New York, 1997 (co-edited with M. Dell'Amico and F. Maffioli), xiii + 495 pages

  • Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer Academic Publishers, Boston, 1999 (co-edited with S. Voss, I.H. Osman and C.Roucairol), xii + 511 pages

  • Surveys in Operations Research, Springer, New York, 2007 (co-edited with D. Bouyssou and F. Plastria), 345 pages

  • Surveys in Operations Research II, Springer, New York, 2010 (co-edited with D. Bouyssou and F. Plastria), 407 pages

  • Surveys in Operations Research III, Springer, New York, 2013 (co-edited with L. Liberti and T. Marchant), 320 pages

  • Computational Issues in Combinatorial Optimization, Springer, New York, 2013 (co-edited with L.F. Escudero and V. Strusevich), 278 pages

  • Surveys in Operations Research IV, Springer, New York, 2016 (co-edited with L. Liberti and T. Marchant), 380 pages

  • Seven Surveys in Operations Research, Springer, New York, 2018 (co-edited with Y. Crama and M. Grabisch), 278 pages

  • Surveys in Operations Research VI, Springer, New York, 2022 (co-edited with Y. Crama and M. Grabisch), 315 pages

Editor-in Chief:

Editor/Area Editor/Associate Editor/Advisory Editor:

Guest Editor (special issues):

Honors

Research and publications:

  • Google Scholar profile (over 23,000 citations, as of December 2022)

  • Papers reviewed on MathSciNet (subscription to the American Mathematical Society needed outside University of Bologna)

  • Ranking of the World's Top 2% Scientists (Stanford University)

  • h-index = 60 (computed by Google Scholar ). Also see Top 10 Italian Scientists in Mathematics and Top H-Index For Scientists in Italy

  • i10-index = 117 (computed by Google Scholar).

  • i100-index = 41 (computed by Google Scholar).

  • i1000-index = 3 (computed by Google Scholar).

  • Web of Science h-index = 35 (computed by ISI Web of Knowledge)

  • Scopus h-index = 39 (computed by Scopus)

  • Erdős number = 3 (via Dominique de Werra and Pavol Hell)

  • Selected publications 1977–

    • [217] L. Galli, S. Martello, C. Rey, P. Toth (2022). Lagrangian matheuristics for the quadratic multiple knapsack problem. Discrete Applied Mathematics (to appear).

    [216] W. Wu, M. Iori, S. Martello, M. Yagiura (2022). An iterated dual substitution approach for binary integer programming problems under the min-max regret criterion. INFORMS Journal on Computing (to appear).

    [215] Y. Crama, M. Grabisch, S. Martello (eds.) (2022). Surveys in Operations Research VI (Invited Surveys from "4OR", 2018-2020), Springer, New York, 315 pages.

    [214] V. Cacchiani, M. Iori, A. Locatelli, S. Martello (2022). Knapsack problems — An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems, Computers & Operations Research 143, 105693.

    [213] V. Cacchiani, M. Iori, A. Locatelli, S. Martello (2022). Knapsack problems — An overview of recent advances. Part I: Single knapsack problems, Computers & Operations Research 143, 105692.

    [212] M. Iori, V.L. de Lima, S. Martello, M. Monaci (2022). 2DPackLib: a two-dimensional cutting and packing library, Optimization Letters 16,471–480.

    [211] Y. Crama, M. Grabisch, S. Martello (2022). Sixty-one surveys in operations research. Annals of Operations Research 314, 5–13.

    [210] J. Gauci, S. Martello (eds.) (2021). Special Issue: Theory and Applications in Combinatorial Optimization (ECCO 2019), Journal of Combinatorial Optimization 42.

    [209] L. Galli, S. Martello, C. Rey, P. Toth (2021). Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem. European Journal of Operational Research 291, 8718–882.

    [208] J. Gauci, S. Martello (2021). Theory and Applications in Combinatorial Optimization, Journal of Combinatorial Optimization 42, 207–211.

    [207] S. Martello (2021). Ricerca Operativa (II Ed.), Esculapio, Bologna, x + 287 pages.

    [206] B. Chen, S. Martello, B. Ries (eds.) (2021). Special Issue: New Progress in Combinatorial Optimization, Discrete Applied Mathematics 290.

    [205] M. Iori, V.L. de Lima, S. Martello, F.K. Miyazawa, M. Monaci (2021). Exact solution techniques for two-dimensional cutting and packing. European Journal of Operational Research 289, 399–415.

    [204] B. Chen, S. Martello, B. Ries (2021). New progress in combinatorial optimization. Discrete Applied Mathematics 290, 68–415.

    [203] G. Homsi, J. Jordan, S. Martello, M. Monaci (2021). The assignment and loading transportation problem. European Journal of Operational Research 289, 999–1007.

    [202] Y. Crama, M. Grabisch, S. Martello (2021). 4OR comes of age. 4OR-A Quarterly Journal of Operations Research 19, 1–13.

    [201] C. D'Ambrosio, S. Martello, M. Monaci (2020). Lower and upper bounds for the non-linear generalized assignment problem. Computers & Operations Research 120, 1–10.

    [200] S. Martello, M.G. Speranza (2020). Ricerca Operativa per l’Economia e l’Impresa (II Ed.), Esculapio, Bologna, x + 246 pages.

    [199] S. Martello, M. Monaci (2020). Algorithmic approaches to the multiple knapsack assignment problem. Omega 90, 1–11.

    [198] S. Martello (2019). Comments on: A comparative study of time aggregation techniques in relation to power capacity-expansion modeling. TOP 27, 414–415.

    [197] A. Brodnik, S. Martello (eds.) (2019). Special Issue: Combinatorial Optimization: Between Practice and Theory, Discrete Applied Mathematics 264.

    [196] M. Dell'Amico, M. Delorme, M. Iori, S. Martello (2019). Mathematical models and decomposition methods for the multiple knapsack problem. European Journal of Operational Research 274, 886–899.

    [195] A. Brodnik, S. Martello (2019). Combinatorial Optimization: Between Practice and Theory. Discrete Applied Mathematics 264, 1–3.

    [194] Y. Crama, M. Grabisch, S. Martello (eds.) (2018). Seven surveys in operations research, Springer, New York, 278 pages.

    [193] W. Wu, M. Iori, S. Martello, M. Yagiura (2018). Exact and heuristic algorithms for the interval min-max regret generalized assignment problem, Computers & Industrial Engineering 125, 98–110.

    [192] T. Jordán, T. Kis, S. Martello (2018). Computational advances in combinatorial optimization, Discrete Applied Mathematics 242, 1–3.

    [191] Y. Crama, M. Grabisch, S. Martello (2018). Surveys in operations research. Annals of Operations Research 271, 3–10.

    [190] C. D'Ambrosio, S.Martello, L. Mencarelli (2018). Relaxations and heuristics for the multiple non-linear separable knapsack problem. Computers & Operations Research 93, 79–89.

    [189] Y. Crama, M. Grabisch, S. Martello (2018). Sweet sixteen. 4OR-A Quarterly Journal of Operations Research 16, 1–13.

    [188] M. Delorme, M. Iori, S. Martello (2018). BPPLIB: a library for bin packing and cutting stock problems. Optimization Letters 12, 235–250.

    [187] T. Jordán, T. Kis, S. Martello (eds.) (2018). Special Issue: Computational Advances in Combinatorial Optimization, Discrete Applied Mathematics 242.

    [186] E. Malaguti, S. Martello, A.M. Santini (2018). The traveling salesman problem with pickups, deliveries, and draft limits. Omega 74, 50–58. Best Paper Award 2018

    [185] G. Costa, M. Delorme, M. Iori, E. Malaguti, S. Martello (2017). Training software for orthogonal packing problems. Computers and Industrial Engineering 111, 139–147.

    [184] B. Chen, P. Gritzmann, S. Martello (2017). Combinatorial optimization: Theory, computation, and applications. Discrete Applied Mathematics 217, 1–2.

    [183] M. Delorme, M. Iori, S. Martello (2017). Logic Based Benders' Decomposition for Orthogonal Stock Cutting Problems. Computers & Operations Research 78, 290–298.

    [182] B. Chen, P. Gritzmann, S. Martello (eds.) (2017). Special Issue: Combinatorial optimization: Theory, computation, and applications, Discrete Applied Mathematics 217 Part 1.

    [181] L. Mencarelli, C. D'Ambrosio, A. Di Zio, S. Martello (2016). Heuristics for the General Multiple Non-linear Knapsack Problem. Electronic Notes in Discrete Mathematics 55, 69–72.

    [180] Y. Crama, M. Grabisch, S. Martello (2016). A brand new cheating attempt: a case of usurped identity. 4OR-A Quarterly Journal of Operations Research 14, 333–336.

    [179] W. Wu, M. Iori, S. Martello and M. Yagiura (2016). An Iterated Dual Substitution Approach for the Min-Max Regret Multidimensional Knapsack Problem. Proceedings IEEE International Conference on Industrial Engineering and Engineering Management (IEEM 2016), 734–738.

    [178] L. Liberti, T. Marchant, S. Martello (2016). Twelve surveys in operations research. Annals of Operations Research 204, 3–11.

    [177] M. Delorme, M. Iori, S. Martello (2016). Bin packing and cutting stock problems: Mathematical models and exact algorithms. European Journal of Operational Research 255, 1–20.

    [176] L. Liberti, T. Marchant, S. Martello (eds.) (2016). Surveys in Operations Research IV, Springer, New York, 380 pages.

    [175] S. Martello, B. Ries (2015). Advances in combinatorial optimization. Discrete Applied Mathematics 196, 1–3.

    [174] S. Martello, M. Monaci (2015). Models and algorithms for packing rectangles into the smallest square. Computers & Operations Research 63, 161–171.

    [173] L. Liberti, T. Marchant, S. Martello (2015). The dirty dozen of 4OR. 4OR-A Quarterly Journal of Operations Research 13, 1–13.

    [172] F. Furini, M. Iori, S. Martello, M. Yagiura (2015). Heuristic and exact algorithms for the interval min-max regret knapsack problem. INFORMS Journal on Computing 27, 392–405.

    [171] S. Martello, B. Ries (eds.) (2015). Special Issue: Advances in Combinatorial Optimization, Discrete Applied Mathematics 196.

    [170] A. Borghetti, C. D’Ambrosio, A. Lodi, S. Martello (2015). Optimal scheduling of a multiunit hydro power station in a short-term planning horizon. K.G. Murty, ed., Case Studies in Operations Research. Springer, New York, 167–181.

    [169] S. Martello (2014). Ricerca Operativa, Esculapio, Bologna, xii + 315 pages.

    [168] C. Cicconetti, L. Lenzini, A. Lodi, S. Martello, E. Mingozzi, M. Monaci (2014). Efficient two-dimensional data allocation in IEEE 802.16 OFDMA. ACM/IEEE Transactions on Networking 22, 1645–1658.

    [167] W. Wu, M. Iori, S. Martello and M. Yagiura (2014). Algorithms for the min-max regret generalized assignment problem with interval data. Proceedings IEEE International Conference on Industrial Engineering and Engineering Management (IEEM 2014), 734–738. Outstanding Paper Award

    [166] R. Rovatti, C. D’Ambrosio, A. Lodi, S. Martello (2014). Optimistic MILP modeling of non-linear optimization problems. European Journal of Operational Research 239, 32–45.

    [165] S. Martello. Two-dimensional packing problems in telecommunications (2014). Pesquisa Operacional 34, 31–38.

    [164] G. Costa, C. D'Ambrosio, S. Martello (2014). GraphsJ 3: A modern didactic application for graph algorithms. Journal of Computer Science 10, 1115–1119.

    [163] A. Lodi, S. Martello, M. Monaci, D. Vigo (2014). Two-dimensional bin packing problems. V. Th. Paschos (ed.). Paradigms of Combinatorial Optimization: Problems and New Approaches, ISTE and John Wiley & Sons, 2nd edition, 107–129.

    [162] S. Martello, G.-W. Weber, Refail Kasimbeyli (2013). An Overview of Advances in Combinatorial Optimization Related Topics. Optimization 62, 1291–1295.

    [161] M. Iori, S. Martello (2013). An annotated bibliography of combined routing and loading problems. Yugoslav Journal of Operations Research 23, 311–326.

    [160] E.G. Coffman, Jr, J. Csirik, G. Galambos, S. Martello, D. Vigo (2013). Bin packing approximation algorithms: Survey and classification. D.-Z. Du, P. M. Pardalos, R.L. Graham (eds.). Handbook of Combinatorial Optimization, 2nd Edition, Springer, 455–531.

    [159] L. Escudero, S. Martello, V. Strusevich (2013). An overview of computational issues in combinatorial optimization, Annals of Operations Research 207, 1–5.

    [158] A.E. Fernandes Muritiba, M. Iori, S. Martello, M.J. Negreiros Gomes (2013). Optimal design of fair layouts. Flexible Services and Manufacturing Journal 25, 443–461.

    [157] L. Liberti, T. Marchant, S. Martello (eds.) (2013). Surveys in Operations Research III, Springer, New York, 320 pages.

    [156] S. Martello, G.-W. Weber, Refail Kasimbeyli (eds.) (2013) Special Issue: An Overview of Advances in Combinatorial Optimization Related Topics, Optimization 62.

    [155] L. Escudero, S. Martello, V. Strusevich (eds.) (2013). Computational Issues in Combinatorial Optimization, Springer, New York, 278 pages.

    [154] L. Liberti, T. Marchant, S. Martello (2013). Eleven surveys in operations research: III. Annals of Operations Research 204, 3–9.

    [153] M. Dell’Amico, M. Iori, S. Martello, M. Monaci (2012). A note on exact and heuristic algorithms for the identical parallel machine scheduling problem, Journal of Heuristics 18, 939-942

    [152] S. Martello, J.M. Paixao (eds.) (2012) Feature Issue: The Past and Present of Optimization, European Journal of Operational Research 219.

    [151] R. Burkard, M. Dell'Amico, S. Martello (2012). Assignment Problems - Revised Reprint, SIAM, Philadelphia, xxii + 393 pages.

    [150] S. Martello, M.G. Speranza (2012). Ricerca Operativa per l’Economia e l’Impresa, Esculapio, Bologna, x + 304 pages.

    [149] S. Martello, J.M. Paixao (2012) A look at the past and present of optimization, European Journal of Operational Research 219, 638-640.

    [148] C.A.J. Hurkens, A. Lodi, S. Martello, M. Monaci, G.J. Woeginger (2012). Complexity and approximation of an area packing problem. Optimization Letters 6, 1-9.

    [147] S. Martello (2011). Ricerca Operativa per la Laurea Magistrale, Esculapio, Bologna, x + 306 pages.

    [146] A. Lodi, S. Martello, M. Monaci, C. Cicconetti, L. Lenzini, E. Mingozzi, C. Eklund, J. Moilanen (2011). Efficient two-dimensional packing algorithms for mobile WiMAX. Management Science 57, 2130-2144.

    [145] J. Blazewicz, V. Boljuncic, S. Martello, J. Skorin-Kapov (eds.) (2011). Special Issue: Combinatorial Optimization, Journal of Scheduling 14.

    [144] C. Cicconetti, L. Lenzini, A. Lodi, S. Martello, E. Mingozzi, M. Monaci (2011). A Fast and Efficient Algorithm to Exploit Multi-user Diversity in IEEE 802.16 BandAMC. Computer Networks 55, 3680-3693.

    [143] S. Martello, H. Vladimirou (eds.) (2011). Special Issue: Developments in combinatorial optimization, Computational Optimization and Applications 48.

    [142] Y. Yamasaki, R. Schiavoni, M. Iori, M. Yagiura, S. Martello (2011). . S. Umetani (ed.). The evolution of optimization models and algorithms, RIMS Kôkyűroku 1726, 139–154.

    [141] S. Martello, H. Vladimirou (2011). Developments in combinatorial optimization. Computational Optimization and Applications 48, 341–343.

    [140] C. D’Ambrosio, A. Lodi, S. Martello (2011). Combinatorial traveling salesman problem algorithms. Wiley Encyclopedia of Operations Research and Management Science, Vol. 1, 738–747.

    [139] J. Blazewicz, V. Boljuncic, S. Martello, J. Skorin-Kapov (2011). Combinatorial optimization issues in scheduling. Journal of Scheduling 14, 221–223.

    [138] C. D’Ambrosio, S. Martello (2011). Heuristic algorithms for the general nonlinear separable knapsack problem. Computers & Operations Research 38, 505–513.

    [137] M. Iori, S. Martello, D. Pretolani (2010). An aggregate label setting policy for the multi-objective shortest path problem. European Journal of Operational Research 207, 1489–1496.

    [136] M. Iori, S. Martello (2010). Rejoinder on: Routing problems with loading constraints. TOP 18, 41–42.

    [135] A.E. Fernandes Muritiba, M. Iori, S. Martello, M.J. Negreiros Gomes (2010). Models and algorithms for fair layout optimization problems. Annals of Operations Research 179, 5–14.

    [134] C. Cicconetti, L. Lenzini, A. Lodi, S. Martello, E. Mingozzi, M. Monaci (2010). Efficient two-dimensional data allocation in IEEE 802.16 OFDMA. Proceedings of IEEE INFOCOM 2010, 2160–2168.

    [133] D. Bouyssou, S. Martello, F. Plastria (eds.) (2010). Surveys in Operations Research II, Springer, New York, 407 pages.

    [132] M. Iori, S. Martello (2010). Routing problems with loading constraints. TOP 18, 4–27.

    [131] S. Martello (2010). Jeno Egerváry: from the origins of the Hungarian algorithm to satellite communication. Central European Journal of Operations Research 18, 47–58.

    [130] C. D’Ambrosio, A. Lodi, S. Martello (2010). Piecewise linear approximation of functions of two variables in MILP models. Operations Research Letters 38 39–46.

    [129] D. Bouyssou, S. Martello, F. Plastria (2010). Eleven surveys in operations research: II. Annals of Operations Research 175, 3–8.

    [128] G. Costa, C. D'Ambrosio, S. Martello (2010). A free educational Java framework for graph algorithms. Journal of Computer Science 6, 87–91.

    [127] D. Bouyssou, S. Martello, F. Plastria (2009). Un plagiat répétitif: Analyse d’un cas de plagiat détecté ŕ 4OR. Available online at Internet: Fraude et déontologie selon les acteurs universitaires.

    [126] D. Bouyssou, S. Martello, F. Plastria (2009). Plagiarism again: Sreenivas and Srinivas, with an update on Marcu. 4OR-A Quarterly Journal of Operations Research 7, 17–20.

    [125] D. Bouyssou, S. Martello, F. Plastria (2009). No 7-year itch at 4OR. 4OR-A Quarterly Journal of Operations Research 7, 1–15.

    [124] R. Burkard, M. Dell'Amico, S. Martello (2009). Assignment Problems, SIAM, Philadelphia, xx + 382 pages.

    [123] M. Kovalyov, S. Martello (2008) Feature Issue: Combinatorics for Modern Manufacturing, Logistics and Supply Chains, European Journal of Operational Research 189, 3.

    [122] M. Iori, S. Martello (2008). Scatter Search Algorithms for Identical Parallel Machine Scheduling Problems. F. Xhafa and A. Abraham (eds.). Metaheuristics for Scheduling in Industrial and Manufacturing Applications, Springer, Berlin, 41–59.

    [121] A. Borghetti, C. D'Ambrosio, A. Lodi, S. Martello (2008). An MILP Approach for Short-Term Hydro Scheduling and Unit Commitment with Head-Dependent Reservoir, IEEE Transactions on Power Systems 23, 1115–1124.

    [120] M. Dell’Amico, M. Iori, S. Martello, M. Monaci (2008). Heuristic and exact algorithms for the identical parallel machine scheduling problem, INFORMS Journal on Computing 20, 333–344.

    [119] M. Kovalyov, S. Martello (2008). Combinatorics for Modern Manufacturing, Logistics and Supply Chains. European Journal of Operational Research 189, 803–806.

    [118] M. Gendreau, M. Iori, G. Laporte, S. Martello (2008). A Tabu search heuristic for the Vehicle Routing Problem with two-dimensional loading constraints, Networks 51, 4–18.

    [117] D. Bouyssou, S. Martello, F. Plastria (eds.) (2007). Surveys in Operations Research, Springer, New York, 345 pages.

    [116] A. Borghetti, A. Lodi, S. Martello, M. Martignani, C. A. Nucci, A. Trebbi (2007). An optimization problem in the electricity market, 4OR-A Quarterly Journal of Operations Research 5, 247–259.

    [115] A. Lodi, S. Martello, D. Vigo (2007). Récentes avancées sur le problème de bin packing à deux dimensions. V. Th. Paschos (ed.). Optimisation combinatoire 4: problèmes paradigmatiques, Hermes Science Publications, Paris, 137–161.

    [114] S. Martello, D. Vigo (2003). Esercizi di Simulazione Numerica (II Ed.), Esculapio, Bologna, 88 pages.

    [113] S. Martello, D. Pisinger, D. Vigo, E. den Boef, J. Korst (2007). Algorithms for General and Robot-Packable Variants of the Three-Dimensional Bin Packing Problem, ACM Transactions on Mathematical Software 33.

    [112] D. Bouyssou, S. Martello, F. Plastria (2007). Eleven surveys in operations research. Annals of Operations Research 153, 3–7.

    [111] G. Hasle, A. Lřkketangen, S. Martello (2006) Feature Issue: Rich models in discrete optimization: Formulation and resolution, European Journal of Operational Research 175, 3.

    [110] A. Caprara, A. Lodi, S. Martello, M. Monaci (2006). Packing into the smallest square: Worst-case analysis of lower bounds. Discrete Optimization 3, 317–326.

    [109] M. Gendreau, M. Iori, G. Laporte, S. Martello (2006). A tabu search algorithm for a routing and container loading problem. Transportation Science 40, 342–350.

    [108] D. Bouyssou, S. Martello, F. Plastria (2006). A case of plagiarism: Danut Marcu. 4OR-A Quarterly Journal of Operations Research 4, 11–13.

    [107] G. Hasle, A. Lřkketangen, S. Martello (2006). Rich models in discrete optimization: Formulation and resolution. European Journal of Operational Research 175, 1752–1753.

    [106] D. Bouyssou, S. Martello, F. Plastria (2006). 4OR: Year 4. 4OR-A Quarterly Journal of Operations Research 4, 1–9.

    [105] M. Dell'Amico, M. Iori, S. Martello, M. Monaci (2006). Lower bounds and heuristic algorithms for the ki-partitioning problem. European Journal of Operational Research 171, 725–742.

    [104] S. Martello, E. Pesch (2005). Logistics: From theory to applications. European Journal of Operational Research, 162, 1–3.

    [103] L. M. Gambardella, S. Martello (eds.) (2005). Feature Issue: Metaheuristics and worst-case guarantee algorithms: Relations, provable properties and applications, European Journal of Operational Research 166, 1.

    [102] E. Den Boef, J. Korst, S. Martello, D. Pisinger, D. Vigo, S. Martello (2005). Erratum: “The three-dimensional bin packing problem”: Robot-packable and orthogonal variants of packing problems. Operations Research 53, 735–736.

    [101] L.M. Gambardella, S. Martello (2005). Metaheuristics and worst-case guarantee algorithms: relations, provable properties and applications (ECCO XV). European Journal of Operational Research 166, 1–2}.

    [100] A. Borghetti, A. Lodi, S. Martello, M. Martignani, C.A. Nucci, A. Trebbi (2005). Linear programming approach for the transition from market-generated hourly energy programs to feasible power generation schedules. Proceedings 15th Power Systems Computation Conference, Liège, Belgium.

    [99] M. Dell'Amico, S. Martello (2005). A note on exact algorithms for the identical parallel machine scheduling problem. European Journal of Operational Research 160, 576–578.

    [98] S. Martello, E. Pesch (eds.) (2005). Feature Issue: Logistics: From theory to application, European Journal of Operational Research, 162, 1.

    [97] A. Lodi, S. Martello, D. Vigo (2004). Models and bounds for two-dimensional level packing problems. Journal of Combinatorial Optimization 8, 363–379.

    [96] S. Martello (2004). Stefano Pallottino 1945–2004. 4OR-A Quarterly Journal of Operations Research 2, 93.

    [95] A. Lodi, S. Martello, D. Vigo (2004). Tspack: A unified tabu search code for multi-dimensional bin packing problems. Annals of Operations Research 131, 203–213.

    [94] M. Dell'Amico, M. Iori, S. Martello (2004). Heuristic algorithms and scatter search for the cardinality constrained P||Cmax problem. Journal of Heuristics 10, 169–204.

    [93] S. Martello, D. Vigo (2003). Esercizi di Ricerca Operativa (IV Ed.), Esculapio, Bologna, 190 pages.

    [92] S. Martello, P. Toth (2003). An exact algorithm for the two-constraint 0-1 knapsack problem. Operations Research 51, 826–835.

    [91] M. Labbé, G. Laporte, S. Martello (2003). Upper bounds and algorithms for the maximum cardinality bin packing problem. European Journal of Operational Research 149, 490–498.

    [90] S. Martello, M. Monaci, D. Vigo (2003). An exact approach to the strip packing problem. INFORMS Journal on Computing 15, 310–319.

    [89] D. Bouyssou, S. Martello, F. Plastria (2003). 4OR for what purpose? 4OR-A Quarterly Journal of Operations Research 1, 1–6.

    [88] M. Iori, S. Martello, M. Monaci (2003). Metaheuristic algorithms for the strip packing problem. P. M. Pardalos, V. Korotkikh (eds.). Optimization and Industry: New Frontiers, Kluwer Academic Publishers, Boston, MA, 159–179.

    [87] G. Improta, S. Martello (eds.) (2002). Feature Issue: Graphs and Scheduling, European Journal of Operational Research, 142, 2.

    [86] A. Lodi, S. Martello, D. Vigo (2002). Recent advances on two-dimensional bin packing problems. Discrete Applied Mathematics 123, 379–396.

    [85] A. Lodi, S. Martello, D. Vigo (2002). Heuristic algorithms for the three-dimensional bin packing problem. European Journal of Operational Research 141, 171–181.

    [84] A. Lodi, S. Martello, M. Monaci (2002). Two-dimensional packing problems: A survey. European Journal of Operational Research 141, 3–13. Over 1000 citations on Google Scholar

    [83] M. Dell'Amico, S. Martello, D. Vigo (2002). A lower bound for the non-oriented two-dimensional bin packing problem. Discrete Applied Mathematics 118, 13–24.

    [82] S. Martello, J.-F. Maurras (eds.) (2002). Feature Issue: Graphs and Scheduling, European Journal of Operational Research, 137, 2.

    [81] A. Borghetti, A. Frangioni, F. Lacalandra, A. Lodi, S. Martello, C. Nucci, A. Trebbi (2001). Lagrangian relaxation and tabu search approaches for the unit commitment problem. 2001 IEEE Porto Power Tech Conference.

    [80] M. Labbé, G. Laporte, S. Martello (eds.) (2001). Special Issue: Combinatorial Optimization Symposium, Discrete Applied Mathematics, 112, 1–3.

    [79] M. Fischetti, A. Lodi, S. Martello, P. Toth (2001). A polyhedral approach to simplified crew scheduling and vehicle scheduling problems. Management Science 47, 833–850.

    [78] M. Dell'Amico, A. Lodi, S. Martello (2001). Efficient algorithms and codes for the k-cardinality assignment problem. Discrete Applied Mathematics 110, 25–40.

    [77] M. Dell'Amico, S. Martello (2001). Bounds for the cardinality constrained P||Cmax problem. Journal of Scheduling 4, 123–138.

    [76] R. Battiti, A. Bertossi, S. Martello (eds.) (2001). Special Issue: Proceedings of the First Conference on Algorithms and Experiments, ALEX98, Discrete Applied Mathematics, 110, 1.

    [75] S. Martello, D. Pisinger, P. Toth (2000). Nouvelles tendences pour les algorithmes exacts du problème de sac a dos en 0-1. Actes des Deuxièmes Journées Francophones de Recherche Opérationnelle, FRANCORO II. Centre de Publication Universitaire, 41–50.

    [74] S. Martello, D. Pisinger, P. Toth (2000). New trends in exact algorithms for the 0-1 knapsack problems. European Journal of Operational Research 123, 325–332.

    [73] S. Martello, D. Pisinger, D. Vigo (2000). The three-dimensional bin packing problem. Operations Research 48, 256–267.

    [72] A. Lodi, S. Martello, D. Vigo (1999). Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problem. INFORMS Journal on Computing 11, 345–357.

    [71] M. Dell'Amico, S. Martello (1999). Reduction of the three partition problem. Journal of Combinatorial Optimization 3, 17–30.

    [70] S. Martello, D. Pisinger, P. Toth (1999). Dynamic programming and strong bounds for the 0-1 knapsack problem. Management Science 45, 414–424.

    [69] A. Lodi, S. Martello, D. Vigo (1999). Approximation algorithms for the oriented two-dimensional bin packing problem. European Journal of Operational Research 112, 158–166.

    [68] S. Voss, S. Martello, I. Osman, C. Roucairol (eds.) (1999). Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer Academic Publishers, Boston, xii + 511 pages.

    [67] J. E. G. Coffman, G. Galambos, S. Martello, D. Vigo (1998). Bin packing approximation algorithms: Combinatorial analysis. D.-Z. Du, P. M. Pardalos (eds.). Handbook of Combinatorial Optimization, Kluwer Academic Publishers, Boston, MA.

    [66] M. Fischetti, S. Martello, P. Toth, D. Vigo (1998). An LP-based heuristic approach to the crew scheduling problem. Proceedings TRISTAN III, San Juan de Puerto Rico.

    [65] S. Martello, D. Vigo (1998). Exact solution of the finite two-dimensional bin packing problem. Management Science 44, 388–399.

    [64] S. Martello, P. Toth (1998). Upper bounds and algorithms for hard 0-1 knapsack problems. Operations Research 45, 768–778.

    [63] A. Lodi, S. Martello, D. Vigo (1998). Neighborhood search algorithm for the guillotine non-oriented two-dimensional bin packing problem. S. Voss, S. Martello, I. Osman, C. Roucairol (eds.). Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer Academic Publishers, Boston, MA, 125–139.

    [62] L. F. Escudero, S. Martello, P. Toth (1998). On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems. G. Mitra, I. Maros, A. Sciomachen (eds.). Applied Mathematical Programming and Modeling III, Annals of Operational Research, 81, J.C. Baltzer AG, Basel, 379–404.

    [61] S. Martello, F. Soumis, P. Toth (1997). Exact and approximation algorithms for makespan minimization on unrelated parallel machines. Discrete Applied Mathematics 75, 169–188.

    [60] F. Maffioli, S. Martello (1997). Selected books in and around combinatorial optimization. M. Dell'Amico, F. Maffioli, S. Martello (eds.). Annotated Bibliographies in Combinatorial Optimization, Wiley, Chichester–New York, 1–12.

    [59] A. Lodi, S. Martello, D. Vigo (1997). Approximation algorithms for the two-dimensional bin packing problem. Proceedings First International Conference on Operations and Quantitative Management, 177–184.

    [58] M. Dell'Amico, F. Maffioli, S. Martello (eds.) (1997). Annotated Bibliographies in Combinatorial Optimization, Wiley, Chichester–New York.

    [57] M. Dell'Amico, S. Martello (1997). Linear assignment. M. Dell'Amico, F. Maffioli, S. Martello (eds.). Annotated Bibliographies in Combinatorial Optimization, Wiley, Chichester–New York, xiii + 495 pages.

    [56] M. Dell'Amico, S. Martello (1997). The k-cardinality assignment problem. Discrete Applied Mathematics 76, 103–121.

    [55] M. Dell'Amico, S. Martello, D. Vigo (1996). Heuristic algorithms for single processor scheduling with earliness and flow-time penalties. I. H. Osman, J. P. Kelly (eds.). Meta-Heuristics: Theory and Applications, Kluwer Academic Publishers, Boston, MA, 167–182.

    [54] M. Dell'Amico, S. Martello (1996). Open shop, satellite communication and a theorem by Egerváry (1931). Operations Research Letters 18, 207–211.

    [53] S. Martello, P. Toth (1995). A note on exact algorithms for the bottleneck generalized assignment problem. European Journal of Operational Research 83, 711–712.

    [52] S. Martello, P. Toth (1995). The bottleneck generalized assignment problem. European Journal of Operational Research 83, 621–638.

    [51] M. Labbé, G. Laporte, S. Martello (1995). An exact algorithm for the dual bin packing problem. Operations Research Letters 17, 9–18.

    [50] M. Dell'Amico, S. Martello, D. Vigo (1995). Minimizing the sum of weighted completion times with unrestricted weights. Discrete Applied Mathematics 63, 25–41.

    [49] M. Dell'Amico, S. Martello (1995). Optimal scheduling of tasks on identical parallel processors. ORSA Journal on Computing 7, 191–200.

    [48] S. Martello (ed.) (1994). Special Issue on Knapsack, Packing and Cutting, Part II: Multidimensional Knapsack and Cutting Stock Problems, INFOR, 32, 4.

    [47] S. Martello (ed.) (1994). Special Issue on Knapsack, Packing and Cutting, Part I: One Dimensional Knapsack Problems, INFOR, 32, 3.

    [46] S. Martello, P. Toth (1993). Introduzione alla Programmazione, Pitagora Editrice, Bologna, xii + 292 pages.

    [45] M. Fischetti, G. Laporte, S. Martello (1993). The delivery man problem and cumulative matroids. Operations Research 41, 1055–1064.

    [44] J. Blazewicz, W. Kubiak, S. Martello (1993). Algorithms for minimizing maximum lateness with unit length tasks and resource constraints. Discrete Applied Mathematics 42, 123–138.

    [43] S. Martello, F. Soumis, P. Toth (1992). An exact algorithm for makespan minimization on unrelated parallel machines. E. Balas, G. Cornuejols, R. Kannan (eds.). Integer Programming and Combinatorial Optimization, Proceedings Second IPCO Conference, Pittsburgh, 181–200.

    [42] S. Martello, P. Toth (1992). Generalized assignment problems. T. Ibaraki, Y. Inagaki, K. Iwama, T. Nishizeki, M. Yamashita (eds.). Algorithms and Computation, Lecture Notes in Computer Science, 650, Springer-Verlag, Berlin, 351–369.

    [41] S. Martello, P. Toth (1992). A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem. Information Processing Letters 44, 221–222.

    [40] M. Fischetti, S. Martello, P. Toth (1992). Approximation algorithms for fixed job schedule problems. Operations Research 40/1, 96–108.

    [39] S. Martello, P. Toth (1990). Knapsack Problems: Algorithms and Computer Implementations, John Wiley & Sons, Chichester–New York, xii + 296 pages.

    [38] S. Martello, P. Toth (1990). Lower bounds and reduction procedures for the bin-packing problem. Discrete Applied Mathematics 26, 59–70.

    [37] S. Martello, P. Toth (1990). An exact algorithm for large unbounded knapsack problems. Operations Research Letters 9, 15–20.

    [36] G. Laporte, S. Martello (1990). The selective travelling salesman problem. Discrete Applied Mathematics 26, 193–207.

    [35] M. Fischetti, S. Martello, P. Toth (1989). Exact and approximate algorithms for bus driver scheduling problems. Proceedings Conference on the Practice and Theory of Operations Management, Paris, AFCET, 251–265.

    [34] M. Fischetti, S. Martello, P. Toth (1989). The fixed job schedule problem with working-time constraints. Operations Research 37, 395–403.

    [33] S. Martello, P. Toth (1988). A new algorithm for the 0-1 knapsack problem. Management Science 34, 633–644.

    [32] M. Fischetti, S. Martello (1988). A hybrid algorithm for finding the k-th smallest of n elements in O(n) time. B. Simeone, P. Toth, G. Gallo, F. Maffioli, S. Pallottino (eds.). Fortran Codes for Network Optimization, Annals of Operational Research, 13, J.C. Baltzer AG, Basel, 401–419.

    [31] G. Carpaneto, S. Martello, P. Toth (1988). Algorithms and codes for the assignment problem. B. Simeone, P. Toth, G. Gallo, F. Maffioli, S. Pallottino (eds.). Fortran Codes for Network Optimization, Annals of Operational Research, 13, J.C. Baltzer AG, Basel, 193–223.

    [30] S. Martello, P. Toth (1987). Linear assignment problems. S. Martello, G. Laporte, M. Minoux, C. Ribeiro (eds.). Surveys in Combinatorial Optimization, Annals of Discrete Mathematics, 31, North-Holland, Amsterdam, 259–282.

    [29] S. Martello, P. Toth (1987). Algorithms for knapsack problems. S. Martello, G. Laporte, M. Minoux, C. Ribeiro (eds.). Surveys in Combinatorial Optimization, Annals of Discrete Mathematics, 31, North-Holland, Amsterdam, 213–258.

    [28] S. Martello, G. Laporte, M. Minoux, C. Ribeiro (eds.) (1987). Surveys in Combinatorial Optimization, volume 31 of Annals of Discrete Mathematics, North-Holland, Amsterdam, ix + 384 pages.

    [27] M. Fischetti, S. Martello, P. Toth (1987). The fixed job schedule problem with spread-time constraints. Operations Research 35, 117–120.

    [26] M. Fischetti, S. Martello (1987). Worst-case analysis of the differencing method for the partition problem. Mathematical Programming 37, 849–858.

    [25] S. Martello, P. Toth (1986). A heuristic approach to the bus driver scheduling problem. European Journal of Operational Research 24, 106–117.

    [24] P. M. Camerini, F. Maffioli, S. Martello, P. Toth (1986). Most and least uniform spanning trees. Discrete Applied Mathematics 15, 181–197.

    [23] S. Martello, P. Toth (1985). A program for the 0-1 multiple knapsack problem. ACM Transactions on Mathematical Software 11, 135–140.

    [22] S. Martello, P. Toth (1985). Approximation schemes for the subset sum problem: Survey and experimental analysis. European Journal of Operational Research 22, 56–69.

    [21] S. Martello, P. Toth (1984). A mixture of dynamic programming and branch-and-bound for the subset-sum problem. Management Science 30, 765–771.

    [20] S. Martello, P. Toth (1984). Worst-case analysis of greedy algorithms for the subset-sum problem. Mathematical Programming 28, 198–205.

    [19] S. Martello, W. Pulleyblank, D. de Werra, P. Toth (1984). Balanced optimization problems. Operations Research Letters 3, 275–278.

    [18] G. Carpaneto, S. Martello, P. Toth (1984). Il Problema dell'Assegnamento: Metodi ed Algoritmi, volume 32 of Monografie di Software Matematico, IAC, Consiglio Nazionale delle Ricerche, Roma, 120 pages.

    [17] G. Carpaneto, S. Martello, P. Toth (1984). An algorithm for the bottleneck travelling salesman problem. Operations Research 32, 380–389.

    [16] S. Martello (1983). A computational comparison of some discrete event simulation languages. Proceedings 4th International Symposium on Modelling and Simulation. ACTA Press, 63–67.

    [15] S. Martello (1983). An enumerative algorithm for finding Hamiltonian circuits in a directed graph. ACM Transactions on Mathematical Software 9, 131–138.

    [14] S. Martello, P. Toth (1982). Finding a minimum equivalent graph of a digraph. Networks 12, 89–100.

    [13] S. Martello, P. Toth (1981). A bound and bound algorithm for the zero-one multiple knapsack problem. Discrete Applied Mathematics 3, 275–288.

    [12] S. Martello, P. Toth (1981). Heuristic algorithms for the multiple knapsack problem. Computing 27, 93–112.

    [11] S. Martello, P. Toth (1981). An algorithm for the generalized assignment problem. J. P. Brans (ed.). Operations Research '81, North-Holland, Amsterdam, 589–603.

    [10] S. Martello, P. Toth (1980). A note on the Ingargiola-Korsh algorithm for one-dimensional knapsack problems. Operations Research 28, 1226–1227.

    [9] S. Martello, P. Toth (1980). Solution of the zero-one multiple knapsack problem. European Journal of Operational Research 4, 276–283.

    [8] S. Martello, P. Toth (1980). Optimal and canonical solutions of the change making problem. European Journal of Operational Research 4, 322–329.

    [7] S. Martello, P. Toth (1979). The 0-1 knapsack problem. N. Christofides, A. Mingozzi, P. Toth, C. Sandi (eds.). Combinatorial Optimization, John Wiley & Sons, Chichester–New York, 237–279.

    [6] S. Martello (1979). An algorithm for finding a minimal equivalent graph of a strongly connected digraph. Computing 21, 183–194.

    [5] S. Martello, P. Toth (1978). Algorithm for the solution of the 0-1 single knapsack problem. Computing 21, 81–86.

    [4] G. Carpaneto, S. Martello (1977). Simulation of a telephone system. Proceedings Fifth Simula Users Conference. Norwegian Computing Center, 29–35.

    [3] S. Martello, P. Toth (1977). Branch and bound algorithms for the solution of the general unidimensional knapsack problem. M. Roubens (ed.). Advances in Operations Research, North-Holland, Amsterdam, 295–301.

    [2] S. Martello (1977). Simfor performance for a large-size simulation model. Proceedings Summer Computer Simulation Conference. Simulation Councils, 13–17.

    [1] S. Martello, P. Toth (1977). An upper bound for the zero-one knapsack problem and a branch and bound algorithm. European Journal of Operational Research 1, 169–175.