Publications

Back to staff profile

  • AC Horne, S Kaur, JM Szemis, A. Costa, R Nathan, JA Webb, MJ Stewardson, N. Boland. Active management of environmental water to improve ecological outcomes. Journal of Water Resources Planning and Management, 144, 04018079 (10pp), 2018. doi: 10.1061/(ASCE)WR.1943-5452.0000991.

  • Sebastian Ruther, N. Boland, Faramroze G Engineer, Ian Evans. Integrated Aircraft Routing, Crew Pairing, and Tail Assignment: Branch-and-Price with Many Pricing Problems. Transportation Science, 51, 177-195, 2017. doi: 10.1287/trsc.2015.0664.

  • N. Boland, Santanu S Dey, Thomas Kalinowski, Marco Molinaro, Fabian Rigterink. Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions. Mathematical Programming, 162, 523-535, 2017. doi: 10.1007/s10107-016-1031-5.

  • N. Boland, Thomas Kalinowski, Fabian Rigterink. A polynomially solvable case of the pooling problem. Journal of Global Optimization, 67, 621-630, 2017. doi: 10.1007/s10898-016-0432-6.

  • N. Boland, Hadi Charkhgard, Martin Savelsbergh. The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs. European Journal of Operational Research, 260, 873-885, 2017. doi: 10.1016/j.ejor.2016.03.035.

  • N. Boland, Hadi Charkhgard, Martin Savelsbergh. A new method for optimizing a linear function over the efficient set of a multiobjective integer program. European Journal of Operational Research, 260, 904-919, 2017. doi: 10.1016/j.ejor.2016.02.037.

  • Avril Horne, Simranjit Kaur, Joanna Szemis, A. Costa, J Angus Webb, Rory Nathan, Michael Stewardson, Lisa Lowe, N. Boland, Natashia Boland. Using optimization to develop a "designer" environmental flow regime. Environmental Modelling & Software, 88, 188-199, 2017. doi: 10.1016/j.envsoft.2016.11.020.

  • N. Boland, M Fischetti, M Monaci, M Savelsbergh. Proximity Benders: a decomposition heuristic for stochastic programs. Journal of Heuristics, 22, 181-198, 2016. doi: 10.1007/s10732-015-9306-1.

  • N. Boland, Irina Dumitrescu, Gary Froyland, Thomas Kalinowski. Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming. Mathematical Programming, 157, 69-93, 2016. doi: 10.1007/s10107-015-0970-6.

  • N. Boland, Riley Clement, Hamish Waterer. A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems. INFORMS Journal on Computing, 28, 14-30, 2016. doi: 10.1287/ijoc.2015.0661.

  • N. Boland, Hadi Charkhgard, Martin Savelsbergh. The L-shape search method for triobjective integer programming. Mathematical Programming Computation, 8, 217-251, 2016. doi: 10.1007/s12532-015-0093-3.

  • N. Boland, Thomas Kalinowski, Fabian Rigterink. New multi-commodity flow formulations for the pooling problem. Journal of Global Optimization, 66, 669-710, 2016. doi: 10.1007/s10898-016-0404-x.

  • Avril Horne, Joanna M Szemis, Simranjit Kaur, J Angus Webb, Michael J Stewardson, A. Costa, N. Boland, Natashia Boland. Optimization tools for environmental water decisions: A review of strengths, weaknesses, and opportunities to improve adoption. Environmental Modelling & Software, 84, 326-338, 2016. doi: 10.1016/j.envsoft.2016.06.028.

  • N. Boland, Thomas Kalinowski, Simranjit Kaur. Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period. Journal of Combinatorial Optimization, 32, 885-905, 2016. doi: 10.1007/s10878-015-9910-x.

  • N. Boland, Hadi Charkhgard, Martin Savelsbergh. A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method. INFORMS Journal on Computing, 27, 597-618, 2015. doi: 10.1287/ijoc.2015.0646.

  • N. Boland, Hadi Charkhgard, Martin Savelsbergh. A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method. INFORMS Journal on Computing, 27, 735-754, 2015. doi: 10.1287/ijoc.2015.0657.

  • A Horne, A. Costa, N. Boland, N Boland, S Kaur, J Szemis, M Stewardson. Developing a seasonal environmental watering tool. The Art and Science of Water - 36th Hydrology and Water Resources Symposium, HWRS 2015, 907-914, 2015.

  • N. Boland, AC Eberhard, A Tsoukalas. A Trust Region Method for the Solution of the Surrogate Dual in Integer Programming. Journal of Optimization Theory and Applications, 167, 558-584, 2015. doi: 10.1007/s10957-014-0681-9.

  • N. Boland, AC Eberhard. On the augmented Lagrangian dual for integer programming. Mathematical Programming, 150, 491-509, 2015. doi: 10.1007/s10107-014-0763-3.

  • N. Boland, Thomas Kalinowski, Simranjit Kaur. Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies. Computers & Operations Research, 64, 113-129, 2015. doi: 10.1016/j.cor.2015.05.011.

  • N. Boland, AC Eberhard, FG Engineer, M Fischetti, MWP Savelsbergh, A Tsoukalas. Boosting the feasibility pump. Mathematical Programming Computation, 6, 255-279, 2014. doi: 10.1007/s12532-014-0068-9.

  • N. Boland, H Charkhgard, M Savelsbergh. The triangle splitting method for biobjective mixed integer programming. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8494 LNCS, 162-173, 2014. doi: 10.1007/978-3-319-07557-0_14.

  • Masoud Talebian, N. Boland, Martin Savelsbergh. Pricing to accelerate demand learning in dynamic assortment planning for perishable products. European Journal of Operational Research, 237, 555-565, 2014. doi: 10.1016/j.ejor.2014.01.045.

  • N. Boland, Thomas Kalinowski, Hamish Waterer, Lanbo Zheng. Scheduling arc maintenance jobs in a network to maximize total flow over time. Discrete Applied Mathematics, 163, 34-52, 2014. doi: 10.1016/j.dam.2012.05.027.

  • N. Boland, Reena Kapoor, Simranjit Kaur, Thomas Kalinowski. Scheduling Unit Time Arc Shutdowns to Maximize Network Flow Over Time: Complexity Results. Networks, 63, 196-202, 2014. doi: 10.1002/net.21536.

  • N. Boland, H Charkhgard, M Savelsbergh. The triangle splitting method for biobjective mixed integer programming. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8494 LNCS, 162-173, 2014. doi: 10.1007/978-3-319-07557-0_14.

  • M Wallace, N. Boland, E Burke. Transport scheduling: Meeting the challenges of scale, complexity and uncertainty. Computers and Operations Research, 40, 655-656, 2013. doi: 10.1016/j.cor.2012.10.011.

  • K. Akartunali, N. Boland, I Evans, M Wallace, H Waterer, K Akartunal, Kerem Akartunalı. Airline planning benchmark problems-Part II: Passenger groups, utility and demand allocation. Computers & Operations Research, 40, 793-804, 2013. doi: 10.1016/j.cor.2012.03.005.

  • S Ruther, N. Boland, F Engineer, I Evans. Integrated aircraft routing, crew pairing, and tail assignment: Branch-and-price with many pricing problems. 53rd AGIFORS Annual Proceedings 2013 - Annual Symposium and Study Group Meeting, AGIFORS 2013, 2, 1341-1361, 2013.

  • N. Boland, Thomas Kalinowski, Hamish Waterer, Lanbo Zheng. Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain. Journal of Scheduling, 16, 649-659, 2013. doi: 10.1007/s10951-012-0284-y.

  • Alexandre Mendes, N. Boland, Patrick Guiney, Carlos Riveros. Switch and Tap-Changer Reconfiguration of Distribution Networks Using Evolutionary Algorithms. IEEE Transactions on Power Systems, 28, 85-92, 2013. doi: 10.1109/TPWRS.2012.2194516.

  • K. Akartunali, N. Boland, Ian Evans, Mark Wallace, Hamish Waterer, K Akartunal. Airline planning benchmark problems-Part I: Characterising networks and demand using limited data. Computers & Operations Research, 40, 775-792, 2013. doi: 10.1016/j.cor.2012.02.012.

  • N. Boland, Martin WP Savelsbergh. Optimizing the Hunter Valley Coal Chain. 9780857297785, 275-302, SPRINGER-VERLAG LONDON LTD, 2012. doi: 10.1007/978-0-85729-778-5_10.

  • N. Boland, AC Eberhard, F Engineer, A Tsoukalas. A new approach to the feasibility pump in mixed integer programming. SIAM Journal on Optimization, 22, 831-861, 2012. doi: 10.1137/110823596.

  • N. Boland, F Engineer, I Evans, S Ruther. Integrating the aircraft routing, crew pairing, and tail number assignment problem. 52nd AGIFORS Annual Proceedings 2012 - Symposium and Study Group Meeting, 1, 637-659, 2012.

  • N. Boland, A. Bley, C. Fricke, G. Froyland, R. Sotirov. Clique-based facets for the precedence constrained knapsack problem. Mathematical Programming, 133, 481-511, 2012. doi: 10.1007/s10107-010-0438-7.

  • N. Boland, F Engineer, I Evans, S Ruther. Integrating the aircraft routing, crew pairing, and tail number assignment problem. 51st AGIFORS Annual Proceedings - Annual Symposium and Study Group Meeting, AGIFORS 2011, 1, 313-329, 2011.

  • N. Boland, T Kalinowski, H Waterer, L Zheng. An optimisation approach to maintenance scheduling for capacity alignment in the Hunter Valley Coal Chain. 35th APCOM Symposium - Application of Computers and Operations Research in the Minerals Industry, Proceedings, 887-897, 2011.

  • N. Boland, F Engineer, M Reisi, M Savelsbergh, H Waterer. Data generation in the Hunter Valley Coal Chain - A case study in capacity assessment. 35th APCOM Symposium - Application of Computers and Operations Research in the Minerals Industry, Proceedings, 795-806, 2011.

  • N. Boland, D Gulczynski, MP Jackson, MWP Savelsbergh, MK Tam. Improved stockyard management strategies for coal export terminals at Newcastle. 19th International Congress on Modelling and Simulation (MODSIM2011), 718-724, 2011.

  • A Mendes, N. Boland, P Guiney, C Riveros. (N-1) contingency planning in radial distribution networks using genetic algorithms. 2010 IEEE/PES Transmission and Distribution Conference and Exposition: Latin America, T and D-LA 2010, 290-297, 2011. doi: 10.1109/TDC-LA.2010.5762896.

  • Alexandre Mendes, N. Boland. Multi-objective Optimisation of Power Restoration in Electricity Distribution Systems. AI 2011: Advances in Artificial Intelligence, 7106, 779-+, 2011. doi: 10.1007/978-3-642-25832-9_79.

  • A. Bley, N. Boland, C. Fricke, G. Froyland. A strengthened formulation and cutting planes for the open pit mine production scheduling problem. Computers & Operations Research, 37, 1641-1647, 2010. doi: 10.1016/j.cor.2009.12.008.

  • N. Boland. Solving Environmental Problems with Integer Programming: Recent Experience and Challenge. 18th World IMACS Congress and MODSIM09 International Congress on Modelling and Simulation, 1-12, 2009.

  • N. Boland, I. Dumitrescu, G. Froyland, Ambros M Gleixner. LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity. Computers & Operations Research, 36, 1064-1089, 2009. doi: 10.1016/j.cor.2007.12.006.

  • D. Baatar, N. Boland, R. Johnston, H. Hamacher. A New Sequential Extraction Heuristic for Optimizing the Delivery of Cancer Radiation Treatment Using Multileaf Collimators. INFORMS Journal on Computing, 21, 224-241, 2009. doi: 10.1287/ijoc.1080.0288.

  • G. Wake, N. Boland, Les S Jennings. Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators. Computers & Operations Research, 36, 795-810, 2009. doi: 10.1016/j.cor.2007.10.027.

  • R. Muhandiramge, N. Boland. Simultaneous Solution of Lagrangean Dual Problems Interleaved with Preprocessing for the Weight Constrained Shortest Path Problem. Networks, 53, 358-381, 2009. doi: 10.1002/net.20292.

  • R. Muhandiramge, N. Boland, S. Wang. Convergent network approximation for the continuous Euclidean length constrained minimum cost path problem. SIAM Journal on Optimization, 20, 54-77, 2009. doi: 10.1137/070695356.

  • N. Boland, B. Hughes, L. Merlot, P Stuckey. New integer linear programming approaches for course timetabling. Computers & Operations Research, 35, 2209-2233, 2008. doi: 10.1016/j.cor.2006.10.016.

  • N. Boland, B. Kallehauge, Oil BG Madsen. Path inequalities for the vehicle routing problem with time windows. Networks, 49, 273-293, 2007. doi: 10.1002/net.20178.

  • D. Baatar, N. Boland, S Brand, P STUCKEY. Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4510, 1-15, 2007.

  • Mak, N. Boland. Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs. Discrete Applied Mathematics, 155, 2093-2110, 2007. doi: 10.1016/j.dam.2007.05.014.

  • N. Boland, J. Dethridge, I. Dumitrescu. Accelerated label setting algorthims for the elementary resource constrained shortest path problem. Operations Research Letters, 34, 58-68, 2006. doi: 10.1016/j.orl.2004.11.011.

  • S Taylor, IM Wanless, N. Boland. Distance domination and amplifier placement problems. Australasian Journal of Combinatorics, 34, 117-136, 2006.

  • N. Boland, P Dominguez-Marin, S Nickel, J Puerto, P Domínguez-Marín. Exact procedures for solving the discrete ordered median problem. Computers & Operations Research, 33, 3270-3300, 2006. doi: 10.1016/j.cor.2005.03.025.

  • V Mak, N. Boland. Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs. Discrete Optimization, 3, 33-49, 2006. doi: 10.1016/j.disopt.2005.10.003.

  • N. Boland, E. Duane, H. Gan, M Helding. Improving order-picking efficiency through better warehouse design.. Proceedings of 18th National Conference of the Australian Society for Operations Research and the 11th Australian Optimisation Day, 32-39, 2005.

  • R Egudo, N. Boland, H. Gan. A mathematical programming based decision support tool for force allocation. Proceedings of 18th National Conference of the Australian Society for Operations Research and the 11th Australian Optimisation Day, 40-49, 2005.

  • AV Tran, RS Tucker, N. Boland. Amplifier placement methods for metropolitan WDM ring networks. Journal of Lightwave Technology, 22, 2509-2522, 2004. doi: 10.1109/JLT.2004.836744.

  • AV Tran, RS Tucker, N. Boland. Amplfier placement methods for metropolitan WDM ring networks. Journal of Lightwave Technology, 22, 2509-2522, 2004. doi: 10.1109/JLT.2004.836744.

  • N. Boland, M Krishnamoorthy, A ERNST, J Ebery. Preprocessing and cutting for multiple allocation hub location problems. European Journal of Operational Research, 155, 638-653, 2004. doi: 10.1016/S0377-2217(03)00072-9.

  • N. Boland, H. Hamacher, F Lenzen. Minimizing Beam-On time in cancer radiation treatment using multileaf collimators. Networks, 43, 226-240, 2004. doi: 10.1002/net.20007.

  • L. Merlot, N. Boland, B. Hughes, PJ Stuckey. A Hybrid Algorithm for the Examination Timetabling Problem. Lecture Notes in Computer Science: Practice and Theory of Automated Timetabling IV, 2740, 207-231, 2003.

  • I. Dumitrescu, N. Boland. Improved preprocessing, labelling and scaling algorithms for the weight constrained shortest path problem. Networks, 42, 135-153, 2003. doi: 10.1002/net.10090.

  • B. Davey, N. Boland, PJ Stuckey. Efficient intelligent backtracking using linear programming. INFORMS Journal on Computing, 14, 373-386, 2002. doi: 10.1287/ijoc.14.4.373.2823.

  • I. Dumitrescu, N. Boland. Algorithms for the weight constrained shortest path problem. International Transactions in Operational Research, 8, 15-29, 2001. doi: 10.1111/1475-3995.00003.

  • AV Tran, RS Tucker, WD Zhong, N. Boland. Efficient design of WDM ring networks with optical amplifiers. Conference Proceedings OECC/IOOC 2001 Incorporating ACOFT, 58-59, 2001.

  • N. Boland, T Surendonk. A column generation approach to delivery planning over time with inhomogeneous service providers and service interval constraints. Annals of Operations Research, 108, 143-156, 2001. doi: 10.1023/A:1016059012379.

  • N. Boland, LW Clarke, GL Nemhauser. The asymmetric traveling salesman problem with replenishment arcs. European Journal of Operational Research, 123, 408-427, 2000. doi: 10.1016/S0377-2217(99)00266-0.

  • P Neame, N. Boland, D. Ralph. An outer approximate subdifferential method for piecewise affine optimization. Mathematical Programming, 87, 57-86, 2000. doi: 10.1007/s101079900112.

  • J Ebery, M Krishnamoorthy, A Ernst, N. Boland. The capacitated multiple allocation hub location problem: Formulations and algorithms. European Journal of Operational Research, 120, 614-631, 2000. doi: 10.1016/S0377-2217(98)00395-6.

  • C Barnhart, N. Boland, LW Clarke, EL Johnson, GL Nemhauser, RG Shenoi. Flight string models for aircraft fleeting and routing. Transportation Science, 32, 208-220, 1998. doi: 10.1287/trsc.32.3.208.

  • N. Boland. A dual-active-set algorithm for positive semi-definite quadratic programming. Mathematical Programming, 78, 1-27, 1997. doi: 10.1007/BF02614503.

  • N. Boland, AT ERNST, CJ Goh, AI MEES. Optimal 2-commodity flows with nonlinear cost-functions. Journal of the Operational Research Society, 46, 1192-1207, 1995. doi: 10.1057/jors.1995.168.

  • N. Boland, AT Ernst, CJ Goh, AI Mees. A faster version of the ASG algorithm. Applied Mathematics Letters, 7, 23-27, 1994. doi: 10.1016/0893-9659(94)90066-3.

  • N. Boland, CJ Goh, AI Mees. An algorithm for non linear network programming: Implementation, results and comparisons. Journal of the Operational Research Society, 43, 979-992, 1992. doi: 10.1057/jors.1992.149.

  • N. Boland, CJ Goh, AI Mees. An algorithm for solving quadratic network flow problems. Applied Mathematics Letters, 4, 61-64, 1991. doi: 10.1016/0893-9659(91)90056-2.

  • N. Boland, AI Mees. New methods for multi-commodity flows. Computers and Mathematics with Applications, 20, 29-38, 1990. doi: 10.1016/0898-1221(90)90066-S.