|
2012
|
Boland Natashia Lesley, Bley Andreas, Fricke Christopher, Froyland Gary, Sotirov Renata, 'Clique-based facets for the precedence constrained knapsack problem', Mathematical Programming, 133 481-511 (2012) [C1] |
|
|
2012
|
Boland Natashia Lesley, Eberhard A C, Engineer Faramroze, Tsoukalas A, 'A new approach to the feasibility pump in mixed integer programming', SIAM Journal on Optimization, 22 831-861 (2012) [C1] |
|
|
2012
|
Boland Natashia Lesley, Gulczynski Damon John, Savelsbergh Mathieu Willem, 'A stockyard planning problem', EURO Journal on Transportation and Logistics, 1 197-236 (2012) [C1] |
|
|
2012
|
Smith Olivia J, Boland Natashia Lesley, Waterer Hamish Alfred, 'Solving shortest path problems with a weight constraint and replenishment arcs', Computers & Operations Research, 39 964-984 (2012) [C1] |
|
|
2011
|
Baatar Davaatseren, Boland Natashia Lesley, Brand Sebastian, Stuckey Peter J, 'CP and IP approaches to cancer radiotherapy delivery optimization', Constraints, 16 173-194 (2011) [C1] |
|
|
2010
|
Bley Andreas, Boland Natashia Lesley, Fricke Christopher, Froyland Gary, 'A strengthened formulation and cutting planes for the open pit mine production scheduling problem', Computers and Operations Research, 37 1641-1647 (2010) [C1] |
|
|
2009
|
BOLAND N, DUMITRESCU I, FROYLAND G, GLEIXNER A M, 'LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity', Computers and Operations Research, 36 1064-1089 (2009) [C1] |
|
|
2009
|
WAKE G M, BOLAND N, JENNINGS L S, 'Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators', Computers and Operations Research, 36 795-810 (2009) [C1] |
|
|
2009
|
Muhandiramge Ranga, Boland Natashia Lesley, 'Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the Weight Constrained Shortest Path Problem', Networks, 53 358-381 (2009) [C1] |
|
|
2008
|
BOLAND N L, HUGHES B D, MERLOT L T, 'New integer linear programming approaches for course timetabling', Computers and Operations Research, 35 2209-2233 (2008) [C1] |
|
|
2007
|
BAATAR D, BOLAND N L, BRAND S, STUCKEY P J, 'Minimum cardinality matrix decomposition into consecutive-ones Matrices: CP and IP approaches', Electronic Notes in Theoretical Computer Science, 4510 1-15 (2007) [C1] |
|
|
2007
|
KALLEHAUGE B, BOLAND N L, MADSEN O, 'Path inequalities for the vehicle routing problem with time windows', Networks, 49 273-293 (2007) [C1] |
|
|
2007
|
MAK V, BOLAND N L, 'Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs', Discrete Applied Mathematics, 155 2093-2110 (2007) [C1] |
|
|
2006
|
BOLAND N L, DETHRIDGE J, DUMITRESCU I, 'Accelerated label setting algorithms for the elementary resource constrained shortest path problem', Operations Research Letters, 34 58-68 (2006) [C1] |
|
|
2006
|
BOLAND N L, DOMINGUEZ-MARIN P, NICKEL S, PUERTO J, 'Exact procedures for solving the discrete ordered median problem', Computers and Operations Research, 33 3270-3300 (2006) [C1] |
|
|
2006
|
MAK V, BOLAND N L, 'Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs', Discrete Optimization, 3 33-49 (2006) [C1] |
|
|
2006
|
TAYLOR S, WANLESS I, BOLAND N L, 'Distance domination and amplifier placement problems', Australasian Journal of Combinatorics, 34 117-136 (2006) [C1] |
|
|
2004
|
BOLAND N L, HAMMACHER H, LENZEN F, 'Minimizing beam-on time in cancer radiation treatment using multileaf collimators', Networks, 43 226-240 (2004) [C1] |
|
|
2004
|
BOLAND N L, KRISHNAMOORTHY M, ERNST A, EBERY J, 'Preprocessing and cutting for multiple allocation hub problems', European Journal of Operational Research, 155 638-653 (2004) [C1] |
|
|
2004
|
TRAN A V, TUCKER R S, BOLAND N L, 'Amplifier placement methods for metropolitan WDM ring networks', Journal of Lightwave Technology, 22 2509-2522 (2004) [C1] |
|
|
2003
|
DUMITRESCU I, BOLAND N L, 'Improved preprocessing, labelling and scaling algorithms for the weight constrained shortest path problem', Networks, 42 135-153 (2003) [C1] |
|