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 | 425 | 2006 |
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 | 420 | 2016 |
The bike sharing rebalancing problem: Mathematical formulations and benchmark instances M Dell'Amico, E Hadjicostantinou, M Iori, S Novellani Omega 45, 7-19, 2014 | 405 | 2014 |
An exact approach for the vehicle routing problem with two-dimensional loading constraints M Iori, JJ Salazar-González, D Vigo Transportation science 41 (2), 253-264, 2007 | 363 | 2007 |
Ant colony optimization for the two-dimensional loading vehicle routing problem G Fuellerer, KF Doerner, RF Hartl, M Iori Computers & Operations Research 36 (3), 655-673, 2009 | 304 | 2009 |
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 | 297 | 2008 |
Routing problems with loading constraints M Iori, S Martello Top 18 (1), 4-27, 2010 | 275 | 2010 |
Metaheuristics for vehicle routing problems with three-dimensional loading constraints G Fuellerer, KF Doerner, RF Hartl, M Iori European Journal of Operational Research 201 (3), 751-759, 2010 | 256 | 2010 |
Chapter 6: pickup-and-delivery problems for goods transportation M Battarra, JF Cordeau, M Iori Vehicle Routing: Problems, Methods, and Applications, Second Edition, 161-191, 2014 | 199 | 2014 |
A destroy and repair algorithm for the bike sharing rebalancing problem M Dell, M Iori, S Novellani, T Stützle Computers & Operations Research 71, 149-162, 2016 | 159 | 2016 |
Algorithms for the bin packing problem with conflicts AEF Muritiba, M Iori, E Malaguti, P Toth Informs Journal on computing 22 (3), 401-415, 2010 | 156 | 2010 |
A heuristic algorithm for a single vehicle static bike sharing rebalancing problem F Cruz, A Subramanian, BP Bruck, M Iori Computers & Operations Research 79, 19-33, 2017 | 152 | 2017 |
The bike sharing rebalancing problem with stochastic demands M Dell’Amico, M Iori, S Novellani, A Subramanian Transportation research part B: methodological 118, 362-380, 2018 | 132 | 2018 |
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 143, 105693, 2022 | 130 | 2022 |
A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading JF Cordeau, M Iori, G Laporte, JJ Salazar González Networks 55 (1), 46-59, 2010 | 128 | 2010 |
Combinatorial Benders' cuts for the strip packing problem JF Côté, M Dell'Amico, M Iori Operations Research 62 (3), 643-661, 2014 | 115 | 2014 |
Exact Solution Techniques for Two-dimensional Cutting and Packing M Iori, VL de Lima, S Martello, FK Miyazawa, M Monaci European Journal of Operational Research 289 (2), 399-415, 2021 | 107 | 2021 |
Metaheuristics for the vehicle routing problem with loading constraints KF Doerner, G Fuellerer, RF Hartl, M Gronalt, M Iori Networks: An International Journal 49 (4), 294-307, 2007 | 97 | 2007 |
Metaheuristic algorithms for the strip packing problem M Iori, S Martello, M Monaci Optimization and industry: new frontiers, 159-179, 2003 | 96 | 2003 |
Enhanced pseudo-polynomial formulations for bin packing and cutting stock problems M Delorme, M Iori INFORMS Journal on Computing 32 (1), 101-119, 2020 | 94 | 2020 |