| Knapsack problems: algorithms and computer implementations S Martello, P Toth John Wiley & Sons, Inc., 1990 | 6731 | 1990 |
| Assignment problems: revised reprint R Burkard, M Dell'Amico, S Martello Society for Industrial and Applied Mathematics, 2012 | 2229 | 2012 |
| Two-dimensional packing problems: A survey A Lodi, S Martello, M Monaci European journal of operational research 141 (2), 241-252, 2002 | 1291 | 2002 |
| The three-dimensional bin packing problem S Martello, D Pisinger, D Vigo Operations research 48 (2), 256-267, 2000 | 1149 | 2000 |
| The selective travelling salesman problem G Laporte, S Martello Discrete applied mathematics 26 (2-3), 193-207, 1990 | 668 | 1990 |
| Dynamic programming and strong bounds for the 0-1 knapsack problem S Martello, D Pisinger, P Toth Management science 45 (3), 414-424, 1999 | 613 | 1999 |
| Exact solution of the two-dimensional finite bin packing problem S Martello, D Vigo Management science 44 (3), 388-399, 1998 | 586 | 1998 |
| Meta-heuristics: Advances and trends in local search paradigms for optimization S Voß, S Martello, IH Osman, C Roucairol Springer Science & Business Media, 2012 | 557 | 2012 |
| Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems A Lodi, S Martello, D Vigo INFORMS journal on computing 11 (4), 345-357, 1999 | 527 | 1999 |
| Recent advances on two-dimensional bin packing problems A Lodi, S Martello, D Vigo Discrete Applied Mathematics 123 (1-3), 379-396, 2002 | 525 | 2002 |
| Bin packing and cutting stock problems: Mathematical models and exact algorithms M Delorme, M Iori, S Martello European Journal of Operational Research 255 (1), 1-20, 2016 | 522 | 2016 |
| New trends in exact algorithms for the 0–1 knapsack problem S Martello, D Pisinger, P Toth European Journal of Operational Research 123 (2), 325-332, 2000 | 464 | 2000 |
| A tabu search algorithm for a routing and container loading problem M Gendreau, M Iori, G Laporte, S Martello Transportation Science 40 (3), 342-350, 2006 | 460 | 2006 |
| Bin packing approximation algorithms: survey and classification EG Coffman Jr, J Csirik, G Galambos, S Martello, D Vigo Handbook of combinatorial optimization, 455-531, 2013 | 455 | 2013 |
| An MILP approach for short-term hydro scheduling and unit commitment with head-dependent reservoir A Borghetti, C D'Ambrosio, A Lodi, S Martello IEEE Transactions on power systems 23 (3), 1115-1124, 2008 | 445 | 2008 |
| Lower bounds and reduction procedures for the bin packing problem S Martello, P Toth Discrete applied mathematics 28 (1), 59-70, 1990 | 438 | 1990 |
| An exact approach to the strip-packing problem S Martello, M Monaci, D Vigo INFORMS journal on Computing 15 (3), 310-319, 2003 | 399 | 2003 |
| A note on exact algorithms for the bottleneck generalized assignment problem S Martello, P Toth European journal of operational research 83 (3), 711-712, 1995 | 324 | 1995 |
| A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints M Gendreau, M Iori, G Laporte, S Martello Networks: An International Journal 51 (1), 4-18, 2008 | 318 | 2008 |
| Knapsack problems-An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems V Cacchiani, M Iori, A Locatelli, S Martello Computers & Operations Research, 105693, 2022 | 316 | 2022 |
Paolo TothUniversità di BolognaVerified email at unibo.it
