Two-dimensional packing problems: A survey A Lodi, S Martello, M Monaci European journal of operational research 141 (2), 241-252, 2002 | 986 | 2002 |

An exact approach to the strip-packing problem S Martello, M Monaci, D Vigo INFORMS Journal on Computing 15 (3), 310-319, 2003 | 311 | 2003 |

Passenger railway optimization A Caprara, L Kroon, M Monaci, M Peeters, P Toth, C Barnhart, G Laporte Transportation, handbooks in operations research and management science 14 …, 2007 | 304 | 2007 |

Light robustness M Fischetti, M Monaci Robust and online large-scale optimization, 61-84, 2009 | 241 | 2009 |

A Lagrangian heuristic algorithm for a real-world train timetabling problem A Caprara, M Monaci, P Toth, PL Guida Discrete applied mathematics 154 (5), 738-753, 2006 | 229 | 2006 |

On the two-dimensional knapsack problem A Caprara, M Monaci Operations Research Letters 32 (1), 5-14, 2004 | 147 | 2004 |

A metaheuristic approach for the vertex coloring problem E Malaguti, M Monaci, P Toth INFORMS Journal on Computing 20 (2), 302-316, 2008 | 137 | 2008 |

Integer linear programming models for 2-staged two-dimensional Knapsack problems A Lodi, M Monaci Mathematical Programming 94 (2), 257-278, 2003 | 126 | 2003 |

An exact approach for the vertex coloring problem E Malaguti, M Monaci, P Toth Discrete Optimization 8 (2), 174-190, 2011 | 105 | 2011 |

Heuristic approaches for the fleet size and mix vehicle routing problem with Time Windows M Dell'Amico, M Monaci, C Pagani, D Vigo Transportation Science 41 (4), 516-526, 2007 | 97 | 2007 |

An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem M Battarra, M Monaci, D Vigo Computers & Operations Research 36 (11), 3041-3050, 2009 | 95 | 2009 |

A set-covering-based heuristic approach for bin-packing problems M Monaci, P Toth INFORMS Journal on Computing 18 (1), 71-85, 2006 | 94 | 2006 |

Models and algorithms for a staff scheduling problem A Caprara, M Monaci, P Toth Mathematical Programming 98 (1-3), 445-476, 2003 | 90 | 2003 |

Cutting plane versus compact formulations for uncertain (integer) linear programs M Fischetti, M Monaci Mathematical Programming Computation 4 (3), 239-273, 2012 | 78 | 2012 |

Cutting plane versus compact formulations for uncertain (integer) linear programs M Fischetti, M Monaci Mathematical Programming Computation 4 (3), 239-273, 2012 | 78 | 2012 |

Metaheuristic algorithms for the strip packing problem M Iori, S Martello, M Monaci Applied Optimization 78, 159-179, 2003 | 78 | 2003 |

Algorithms for packing and scheduling problems M Monaci 4OR: A Quarterly Journal of Operations Research 1 (1), 85-87, 2003 | 70 | 2003 |

Proximity search for 0-1 mixed-integer convex programming M Fischetti, M Monaci Journal of Heuristics 20 (6), 709-731, 2014 | 66 | 2014 |

Exploiting erraticism in search M Fischetti, M Monaci Operations Research 62 (1), 114-122, 2014 | 64 | 2014 |

Thinning out Steiner trees: a node-based model for uniform edge costs M Fischetti, M Leitner, I Ljubić, M Luipersbeck, M Monaci, M Resch, ... Mathematical Programming Computation 9 (2), 203-229, 2017 | 59 | 2017 |