Home page of Silvano Martello

DEIS, University of Bologna
Viale Risorgimento 5
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

                        

    

Bio:

  • Born: Bologna, 1948

  • Education: Electronic Engineering, University of Bologna, 1973

  • 1974–1980: Teaching and scientific formation study grant, University of Bologna

  • 1980–1985: Research associate, University of Bologna

  • 1985–1990: Associate Professor of Operations Research, University of Bologna

  • 1990–1994: Full Professor of Operations Research and Management Science, University of Turin

  • 1994–: Full Professor of Operations Research, University of Bologna

Authored Books:

Edited Books:

Editor-in Chief:

Editor/Area Editor/Associate Editor/Advisory Editor:

Guest Editor (special issues):

Miscellaneous

Research and publications:

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

  • See the citations on Google Scholar

  • h-index = 38 (computed with Harzing's Publish or Perish)

  • g-index = 85 (computed with Harzing's Publish or Perish)

  • ISI h-index = 23 (computed with ISI Web of Knowledge, books and conference proceedings are not counted)

  • Erdos number = 3 (via Dominique de Werra and Pavol Hell)

  • Selected publications 1977–

    • [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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    [83] A. Lodi, S. Martello, M. Monaci (2002). Two-dimensional packing problems: A survey. European Journal of Operational Research 141, 3–13.

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

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

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

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

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

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

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

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

    [92] 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] 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] S. Martello (2004). Stefano Pallottino 1945–2004. 4OR-A Quarterly Journal of Operations Research 2, 93.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    [120] G. Costa, C. D'Ambrosio, S. Martello (2010). A Free Educational Java Framework for Graph Algorithms. Journal of Computer Science 6, 87–91.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    [143] A.E. Fernandes Muritiba, M. Iori, S. Martello, M.J. Negreiros Gomes (2012). Optimal design of fair layouts. Flexible Services and Manufacturing Journal (to appear).

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

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

    [146] L. Escudero, S. Martello, V. Strusevich (eds.) (2012). Computational Issues in Combinatorial Optimization, Springer, New York (to appear).

    [147] E.G. Coffman, Jr, J. Csirik, G. Galambos, S. Martello, D. Vigo (2012). Bin Packing Approximation Algorithms: Survey and Classification. D.-Z. Du, P. M. Pardalos, R.L. Graham (eds.). Handbook of Combinatorial Optimization, 2nd Edition, Springer (to appear).