Flight string models for aircraft fleeting and routing C Barnhart, NL Boland, LW Clarke, EL Johnson, GL Nemhauser, ... Transportation science 32 (3), 208-220, 1998 | 436 | 1998 |

The capacitated multiple allocation hub location problem: Formulations and algorithms J Ebery, M Krishnamoorthy, A Ernst, N Boland European journal of operational research 120 (3), 614-631, 2000 | 369 | 2000 |

A hybrid algorithm for the examination timetabling problem LTG Merlot, N Boland, BD Hughes, PJ Stuckey International Conference on the Practice and Theory of Automated Timetabling …, 2002 | 273 | 2002 |

Improved preprocessing, labeling and scaling algorithms for the weight‐constrained shortest path problem I Dumitrescu, N Boland Networks: An International Journal 42 (3), 135-153, 2003 | 246 | 2003 |

Accelerated label setting algorithms for the elementary resource constrained shortest path problem N Boland, J Dethridge, I Dumitrescu Operations Research Letters 34 (1), 58-68, 2006 | 211 | 2006 |

Preprocessing and cutting for multiple allocation hub location problems N Boland, M Krishnamoorthy, AT Ernst, J Ebery European Journal of Operational Research 155 (3), 638-653, 2004 | 191 | 2004 |

LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity N Boland, I Dumitrescu, G Froyland, AM Gleixner Computers & Operations Research 36 (4), 1064-1089, 2009 | 182 | 2009 |

A strengthened formulation and cutting planes for the open pit mine production scheduling problem A Bley, N Boland, C Fricke, G Froyland Computers & Operations Research 37 (9), 1641-1647, 2010 | 123 | 2010 |

Minimizing beam‐on time in cancer radiation treatment using multileaf collimators N Boland, HW Hamacher, F Lenzen Networks: An International Journal 43 (4), 226-240, 2004 | 118 | 2004 |

The continuous-time service network design problem N Boland, M Hewitt, L Marshall, M Savelsbergh Operations research 65 (5), 1303-1321, 2017 | 90 | 2017 |

Exact procedures for solving the discrete ordered median problem N Boland, P Domínguez-Marín, S Nickel, J Puerto Computers & Operations Research 33 (11), 3270-3300, 2006 | 86 | 2006 |

Algorithms for the weight constrained shortest path problem I Dumitrescu, N Boland International Transactions in Operational Research 8 (1), 15-29, 2001 | 86 | 2001 |

A multistage stochastic programming approach to open pit mine production scheduling with uncertain geology N Boland, I Dumitrescu, G Froyland Optimization online, 1-33, 2008 | 85 | 2008 |

A criterion space search algorithm for biobjective integer programming: The balanced box method N Boland, H Charkhgard, M Savelsbergh INFORMS Journal on Computing 27 (4), 735-754, 2015 | 75 | 2015 |

Solving shortest path problems with a weight constraint and replenishment arcs OJ Smith, N Boland, H Waterer Computers & Operations Research 39 (5), 964-984, 2012 | 74 | 2012 |

New integer linear programming approaches for course timetabling N Boland, BD Hughes, LTG Merlot, PJ Stuckey Computers & Operations Research 35 (7), 2209-2233, 2008 | 73 | 2008 |

Comparison of mixed-integer programming and genetic algorithm methods for distributed generation planning JD Foster, AM Berry, N Boland, H Waterer IEEE transactions on power systems 29 (2), 833-843, 2013 | 70 | 2013 |

Switch and tap-changer reconfiguration of distribution networks using evolutionary algorithms A Mendes, N Boland, P Guiney, C Riveros IEEE transactions on power systems 28 (1), 85-92, 2012 | 59 | 2012 |

The L-shape search method for triobjective integer programming N Boland, H Charkhgard, M Savelsbergh Mathematical Programming Computation 8 (2), 217-251, 2016 | 58 | 2016 |

A criterion space search algorithm for biobjective mixed integer programming: The triangle splitting method N Boland, H Charkhgard, M Savelsbergh INFORMS Journal on Computing 27 (4), 597-618, 2015 | 55 | 2015 |