Profile Image

Conjoint Professor Natashia Boland

Conjoint Professor

School of Mathematical and Physical Sciences (Mathematics)

Career Summary

Biography

Research Expertise
- Operations Research - Optimisation - Applied Discrete Mathematics

Qualifications

  • PhD, University of Western Australia

Keywords

  • Applied Discrete Mathematics
  • Operations Research
  • Optimisation
  • Scheduling
  • airline planning
  • branch-and-cut
  • branch-and-price
  • combinatorial optimisation
  • combinatorial optimization
  • constrained shortest paths
  • constraint programming
  • dynamic work design
  • facility location
  • hub location
  • integer programming
  • logistics
  • maintenance scheduling
  • mine planning
  • network design
  • open-pit mining
  • operations research
  • optimisation
  • optimization
  • polyhedral analysis
  • production scheduling
  • shortest path problems
  • stochastic programming
  • supply chain management
  • transportation

Fields of Research

Code Description Percentage
010199 Pure Mathematics not elsewhere classified 15
010206 Operations Research 65
080202 Applied Discrete Mathematics 20
Edit

Publications

For publications that are currently unpublished or in-press, details are shown in italics.


Chapter (2 outputs)

Year Citation Altmetrics Link
2012 Boland NL, Savelsbergh MWP, 'Optimizing the Hunter Valley Coal Chain', Supply Chain Disruptions: Theory and Practice of Managing Risk, Springer, London 275-302 (2012) [B1]
DOI 10.1007/978-0-85729-778-5_10
Citations Scopus - 11
2003 Merlot LTG, Boland N, Hughes BD, Stuckey PJ, 'A hybrid algorithm for the examination timetabling problem', , SPRINGER-VERLAG BERLIN 207-231 (2003) [B1]
Citations Scopus - 108Web of Science - 81

Journal article (68 outputs)

Year Citation Altmetrics Link
2017 Ruther S, Boland N, Engineer FG, Evans I, 'Integrated Aircraft Routing, Crew Pairing, and Tail Assignment: Branch-and-Price with Many Pricing Problems', TRANSPORTATION SCIENCE, 51 177-195 (2017) [C1]
DOI 10.1287/trsc.2015.0664
2017 Boland N, Kalinowski T, Rigterink F, 'A polynomially solvable case of the pooling problem', Journal of Global Optimization, 67 621-630 (2017) [C1]
DOI 10.1007/s10898-016-0432-6
Co-authors Thomas Kalinowski
2017 Boland N, Hewitt M, Marshall L, Savelsbergh M, 'The continuous-time service network design problem', Operations Research, 65 1303-1321 (2017)

© 2017 INFORMS. Consolidation carriers transport shipments that are small relative to trailer capacity. To be cost effective, the carrier must consolidate shipments, which requir... [more]

© 2017 INFORMS. Consolidation carriers transport shipments that are small relative to trailer capacity. To be cost effective, the carrier must consolidate shipments, which requires coordinating their paths in both space and time; i.e., the carrier must solve a service network design problem. Most service network design models rely on discretization of time-i.e., instead of determining the exact time at which a dispatch should occur, the model determines a time interval during which a dispatch should occur. While the use of time discretization is widespread in service network design models, a fundamental question related to its use has never been answered: Is it possible to produce an optimal continuoustime solution without explicitly modeling each point in time? We answer this question in the affirmative. We develop an iterative refinement algorithm using partially time-expanded networks that solves continuous-time service network design problems. An extensive computational study demonstrates that the algorithm not only is of theoretical interest but also performs well in practice.

DOI 10.1287/opre.2017.1624
2017 Archetti C, Boland N, Speranza MG, 'A matheuristic for the multivehicle inventory routing problem', INFORMS Journal on Computing, 29 377-387 (2017)

© 2017 INFORMS. We consider the inventory routing problem, in which a supplier has to replenish a set of customers by means of a limited fleet of capacitated vehicles over a disc... [more]

© 2017 INFORMS. We consider the inventory routing problem, in which a supplier has to replenish a set of customers by means of a limited fleet of capacitated vehicles over a discrete time horizon. The goal is to minimize the total cost of the distribution that comprises the inventory cost at the supplier and at the customers and the routing cost. We present a matheuristic that combines a tabu search and mathematical programming formulations. When compared with two exact methods on 640 small instances, the matheuristic finds 192 (48%) optima over the 402 instances with known optima and improves 125 upper bounds. Tested on 240 large instances (with up to 200 customers) for which no optimal solutions are known, it improves the best solution for 220 (92%) of the 240 instances.

DOI 10.1287/ijoc.2016.0737
Citations Scopus - 1
2017 Horne A, Kaur S, Szemis J, Costa A, Webb JA, Nathan R, et al., 'Using optimization to develop a ¿designer¿ environmental flow regime', Environmental Modelling and Software, 88 188-199 (2017)

© 2016 Elsevier Ltd There are increasing numbers of rivers with large storages, resulting in changes to environmental condition downstream. In these systems, environmental flow r... [more]

© 2016 Elsevier Ltd There are increasing numbers of rivers with large storages, resulting in changes to environmental condition downstream. In these systems, environmental flow regimes that are specifically designed to meet environmental management objectives, whilst continuing to support economic needs, may be the best approach. A challenge remains as to how best to design these novel flow regimes. Decision support tools such as optimization provide a potential tool to achieve this. In existing tools environmental outcomes are not represented with sufficient realism and this is a major barrier to successful adoption by decision-makers. Here, we employ conditional probability networks as a promising approach that provides both ease of modelling and a direct link to ecological outcomes and processes. We present a generic model that can be used to represent any ecological endpoint within a river system. We then demonstrate the approach using two fish species in the Yarra River, Victoria.

DOI 10.1016/j.envsoft.2016.11.020
Citations Scopus - 1
2017 Boland N, Dey S, Kalinowski T, Molinaro M, Rigterink F, 'Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions', Mathematical Programming, 162 523-535 (2017) [C1]
DOI 10.1007/s10107-016-1031-5
Citations Scopus - 1Web of Science - 1
Co-authors Thomas Kalinowski
2017 Boland N, Charkhgard H, Savelsbergh M, 'The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs', European Journal of Operational Research, 260 873-885 (2017) [C1]
DOI 10.1016/j.ejor.2016.03.035
2017 Boland N, Charkhgard H, Savelsbergh M, '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) [C1]
DOI 10.1016/j.ejor.2016.02.037
Citations Scopus - 1
2016 Horne A, Szemis JM, Kaur S, Webb JA, Stewardson MJ, Costa A, Boland N, '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
Citations Scopus - 3Web of Science - 1
2016 Boland N, Fischetti M, Monaci M, Savelsbergh M, 'Proximity Benders: a decomposition heuristic for stochastic programs', JOURNAL OF HEURISTICS, 22 181-198 (2016)
DOI 10.1007/s10732-015-9306-1
Citations Scopus - 1Web of Science - 1
2016 Boland N, Kalinowski T, Rigterink F, 'New multi-commodity flow formulations for the pooling problem', Journal of Global Optimization, 66 669-710 (2016) [C1]
DOI 10.1007/s10898-016-0404-x
Citations Scopus - 3Web of Science - 4
Co-authors Thomas Kalinowski
2016 Boland N, Clement R, Waterer H, 'A bucket indexed formulation for nonpreemptive single machine scheduling problems', INFORMS Journal on Computing, 28 14-30 (2016) [C1]

© 2016 INFORMS. Anew mixed-integer linear programming (MILP) formulation for nonpreemptive single machine scheduling problems is presented. The model is a generalisation of the c... [more]

© 2016 INFORMS. Anew mixed-integer linear programming (MILP) formulation for nonpreemptive single machine scheduling problems is presented. The model is a generalisation of the classical time indexed (TI) model to one in which at most two jobs can be processing in each time period. Like the TI model, the new model, called the bucket indexed (BI) model, partitions the planning horizon into periods of equal length, or buckets. Unlike the TI model, the length of a period is a parameter of the BI model and can be chosen to be as long as the processing time of the shortest job. The two models are equivalent if a period is of unit length, but when longer periods are used in the BI model, it can have significantly fewer variables and nonzeros than the corresponding TI model. A computational study using weighted tardiness instances, and weighted completion time instances with release dates, reveals that the BI model significantly outperforms the TI model on instances where the minimum processing time of the jobs is large. Furthermore, the performance of the BI model is less vulnerable to increases in average processing time when the ratio of the largest processing time to the smallest is held constant.

DOI 10.1287/ijoc.2015.0661
Citations Scopus - 1
Co-authors Hamish Waterer
2016 Boland N, Charkhgard H, Savelsbergh M, 'The L-shape search method for triobjective integer programming', Mathematical Programming Computation, 8 217-251 (2016) [C1]

© 2015, Springer-Verlag Berlin Heidelberg and The Mathematical Programming Society. We present a new criterion space search method, the L-shape search method, for finding all non... [more]

© 2015, Springer-Verlag Berlin Heidelberg and The Mathematical Programming Society. We present a new criterion space search method, the L-shape search method, for finding all nondominated points of a triobjective integer program. The method is easy to implement, and is more efficient than existing methods. Moreover, it is intrinsically well-suited for producing high quality approximate nondominated frontiers early in the search process. An extensive computational study demonstrates its efficacy.

DOI 10.1007/s12532-015-0093-3
Citations Web of Science - 2
2016 Boland N, Kalinowski T, Kaur S, '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) [C1]
DOI 10.1007/s10878-015-9910-x
Citations Scopus - 1
Co-authors Thomas Kalinowski
2016 Boland N, Dumitrescu I, Froyland G, Kalinowski T, 'Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming', Mathematical Programming, 157 69-93 (2016) [C1]

© 2016, Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society. We consider multistage stochastic programs, in which decisions can adapt over time, (i.e., at eac... [more]

© 2016, Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society. We consider multistage stochastic programs, in which decisions can adapt over time, (i.e., at each stage), in response to observation of one or more random variables (uncertain parameters). The case that the time at which each observation occurs is decision-dependent, known as stochastic programming with endogeneous observation of uncertainty, presents particular challenges in handling non-anticipativity. Although such stochastic programs can be tackled by using binary variables to model the time at which each endogenous uncertain parameter is observed, the consequent conditional non-anticipativity constraints form a very large class, with cardinality in the order of the square of the number of scenarios. However, depending on the properties of the set of scenarios considered, only very few of these constraints may be required for validity of the model. Here we characterize minimal sufficient sets of non-anticipativity constraints, and prove that their matroid structure enables sets of minimum cardinality to be found efficiently, under general conditions on the structure of the scenario set.

DOI 10.1007/s10107-015-0970-6
Citations Scopus - 1Web of Science - 1
Co-authors Thomas Kalinowski
2015 Boland NL, Eberhard AC, 'On the augmented Lagrangian dual for integer programming', Mathematical Programming, 150 491-509 (2015) [C1]

© 2014, Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society. We consider the augmented Lagrangian dual for integer programming, and provide a primal character... [more]

© 2014, Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society. We consider the augmented Lagrangian dual for integer programming, and provide a primal characterization of the resulting bound. As a corollary, we obtain proof that the augmented Lagrangian is a strong dual for integer programming. We are able to show that the penalty parameter applied to the augmented Lagrangian term may be placed at a fixed, large value and still obtain strong duality for pure integer programs.

DOI 10.1007/s10107-014-0763-3
Citations Scopus - 3
2015 Boland N, Savelsbergh M, Waterer H, 'A decision support tool for generating shipping data for the Hunter Valley coal chain', Computers and Operations Research, 53 54-67 (2015) [C1]

Strategic capacity planning is a core activity for the Hunter Valley Coal Chain Coordinator as demand for coal is expected to double in the next decade. Optimization and simulatio... [more]

Strategic capacity planning is a core activity for the Hunter Valley Coal Chain Coordinator as demand for coal is expected to double in the next decade. Optimization and simulation models are used to suggest and evaluate infrastructure expansions and operating policy changes. These models require input data in the form of shipping stems, which are arrival streams of ships at the port, together with their cargo types and composition. Creating shipping stems that accurately represent future demand scenarios has been a time-consuming and daunting challenge. We describe an optimization-based decision support tool that facilitates and enhances this process, and which has become an integral part of the company's work flow. The tool embeds sampling to enable the generation of multiple shipping stems for a single demand scenario, employs targets, and desirable and permissable ranges to specify and control the characteristics of the shipping stems, and uses integer programming in a hierarchical fashion to generate shipping stems that best meet the set goals. © 2014 Elsevier Ltd.

DOI 10.1016/j.cor.2014.07.016
Citations Scopus - 1Web of Science - 3
Co-authors Hamish Waterer
2015 Boland N, Charkhgard H, Savelsbergh M, 'A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method', INFORMS JOURNAL ON COMPUTING, 27 735-754 (2015) [C1]
DOI 10.1287/ijoc.2015.0657
Citations Scopus - 6Web of Science - 3
2015 Boland N, Charkhgard H, Savelsbergh M, 'A criterion space search algorithm for biobjective mixed integer programming: The triangle splitting method', INFORMS Journal on Computing, 27 597-618 (2015) [C1]

© 2015 INFORMS. We present the first criterion space search algorithm, the triangle splitting method, for finding all nondominated points of a biobjective mixed integer program. ... [more]

© 2015 INFORMS. We present the first criterion space search algorithm, the triangle splitting method, for finding all nondominated points of a biobjective mixed integer program. The algorithm is relatively easy to implement and converges quickly to the complete set of nondominated points. The algorithm maintains, at any point in time, a diverse set of nondominated points, and is thus ideally suited for fast approximation of the nondominated frontier. An extensive computational study demonstrates the efficacy of the triangle splitting method.

DOI 10.1287/ijoc.2015.0646
Citations Scopus - 7Web of Science - 7
2015 Boland N, Kalinowski T, Kaur S, 'Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies', Computers and Operations Research, 64 113-129 (2015) [C1]
DOI 10.1016/j.cor.2015.05.011
Citations Scopus - 1
Co-authors Thomas Kalinowski
2014 Boland N, Eberhard AC, Tsoukalas A, 'A Trust Region Method for the Solution of the Surrogate Dual in Integer Programming', Journal of Optimization Theory and Applications, (2014) [C1]

We propose an algorithm for solving the surrogate dual of a mixed integer program. The algorithm uses a trust region method based on a piecewise affine model of the dual surrogate... [more]

We propose an algorithm for solving the surrogate dual of a mixed integer program. The algorithm uses a trust region method based on a piecewise affine model of the dual surrogate value function. A new and much more flexible way of updating bounds on the surrogate dual¿s value is proposed, in which numerical experiments prove to be advantageous. A proof of convergence is given and numerical tests show that the method performance is better than a state of the art subgradient solver. Incorporation of the surrogate dual value as a cut added to the integer program is shown to greatly reduce solution times of a standard commercial solver on a specific class of problems.

DOI 10.1007/s10957-014-0681-9
2014 Boland N, Kapoor R, Kaur S, Kalinowski T, 'Scheduling Unit Time Arc Shutdowns to Maximize Network Flow Over Time: Complexity Results', NETWORKS, 63 196-202 (2014) [C1]
DOI 10.1002/net.21536
Citations Scopus - 2Web of Science - 2
Co-authors Thomas Kalinowski
2014 Boland N, Kalinowski T, Waterer H, Zheng L, 'Scheduling arc maintenance jobs in a network to maximize total flow over time', DISCRETE APPLIED MATHEMATICS, 163 34-52 (2014) [C1]
DOI 10.1016/j.dam.2012.05.027
Citations Scopus - 5Web of Science - 5
Co-authors Thomas Kalinowski, Hamish Waterer
2014 Boland N, Charkhgard H, Savelsbergh M, '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)

We present the first criterion space search algorithm, the triangle splitting method, for finding the efficient frontier of a biobjective mixed integer program. The algorithm is r... [more]

We present the first criterion space search algorithm, the triangle splitting method, for finding the efficient frontier of a biobjective mixed integer program. The algorithm is relatively easy to implement and converges quickly to the complete set of nondominated points. A computational study demonstrates the efficacy of the triangle splitting method. © 2014 Springer International Publishing Switzerland.

DOI 10.1007/978-3-319-07557-0-14
2014 Foster JD, Berry AM, Boland N, Waterer H, 'Comparison of mixed-integer programming and genetic algorithm methods for distributed generation planning', IEEE Transactions on Power Systems, 29 833-843 (2014) [C1]
DOI 10.1109/TPWRS.2013.2287880
Citations Scopus - 16Web of Science - 8
Co-authors Hamish Waterer
2014 Talebian M, Boland N, Savelsbergh M, 'Pricing to accelerate demand learning in dynamic assortment planning for perishable products', European Journal of Operational Research, (2014) [C1]

Retailers, from fashion stores to grocery stores, have to decide what range of products to offer, i.e., their product assortment. Frequent introduction of new products, a recent b... [more]

Retailers, from fashion stores to grocery stores, have to decide what range of products to offer, i.e., their product assortment. Frequent introduction of new products, a recent business trend, makes predicting demand more difficult, which in turn complicates assortment planning. We propose and study a stochastic dynamic programming model for simultaneously making assortment and pricing decisions which incorporates demand learning using Bayesian updates. We show analytically that it is profitable for the retailer to use price reductions early in the sales season to accelerate demand learning. A computational study demonstrates the benefits of such a policy and provides managerial insights that may help improve a retailer's profitability. © 2014 Elsevier B.V. All rights reserved.

DOI 10.1016/j.ejor.2014.01.045
Citations Scopus - 7Web of Science - 3
2014 Boland NL, Eberhard AC, Engineer FG, Fischetti M, Savelsbergh MWP, Tsoukalas A, 'Boosting the feasibility pump', Mathematical Programming Computation, 6 255-279 (2014)

© 2014, Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society. The feasibility pump (FP) has proved to be an effective method for finding feasible solutions to ... [more]

© 2014, Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society. The feasibility pump (FP) has proved to be an effective method for finding feasible solutions to mixed integer programming problems. FP iterates between a rounding procedure and a projection procedure, which together provide a sequence of points alternating between LP feasible but fractional solutions, and integer but LP infeasible solutions. The process attempts to minimize the distance between consecutive iterates, producing an integer feasible solution when closing the distance between them. We investigate the benefits of enhancing the rounding procedure with a clever integer line search that efficiently explores a large set of integer points. An extensive computational study on benchmark instances demonstrates the efficacy of the proposed approach.

DOI 10.1007/s12532-014-0068-9
Citations Scopus - 5
2013 Wallace M, Boland N, Burke E, 'Transport scheduling: Meeting the challenges of scale, complexity and uncertainty', COMPUTERS & OPERATIONS RESEARCH, 40 655-656 (2013) [C3]
DOI 10.1016/j.cor.2012.10.011
2013 Akartunali K, Boland N, Evans I, Wallace M, Waterer H, 'Airline planning benchmark problems-Part I: Characterising networks and demand using limited data', COMPUTERS & OPERATIONS RESEARCH, 40 775-792 (2013) [C1]
DOI 10.1016/j.cor.2012.02.012
Citations Scopus - 1
Co-authors Hamish Waterer
2013 Akartunali K, Boland N, Evans I, Wallace M, Waterer H, 'Airline planning benchmark problems-Part II: Passenger groups, utility and demand allocation', COMPUTERS & OPERATIONS RESEARCH, 40 793-804 (2013) [C1]
DOI 10.1016/j.cor.2012.03.005
Citations Scopus - 1Web of Science - 1
Co-authors Hamish Waterer
2013 Mendes A, Boland N, Guiney P, Riveros C, 'Switch and Tap-Changer Reconfiguration of Distribution Networks Using Evolutionary Algorithms', IEEE TRANSACTIONS ON POWER SYSTEMS, 28 85-92 (2013) [C1]
DOI 10.1109/TPWRS.2012.2194516
Citations Scopus - 25Web of Science - 19
Co-authors Alexandre Mendes, Carlos Riveros
2013 Boland N, Kalinowski T, Waterer H, Zheng L, 'Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain', JOURNAL OF SCHEDULING, 16 649-659 (2013) [C1]
DOI 10.1007/s10951-012-0284-y
Citations Scopus - 7Web of Science - 6
Co-authors Thomas Kalinowski, Hamish Waterer
2012 Boland NL, Bley A, Fricke C, Froyland G, Sotirov R, 'Clique-based facets for the precedence constrained knapsack problem', Mathematical Programming, 133 481-511 (2012) [C1]
Citations Scopus - 5Web of Science - 4
2012 Smith OJ, Boland NL, Waterer HA, 'Solving shortest path problems with a weight constraint and replenishment arcs', Computers & Operations Research, 39 964-984 (2012) [C1]
DOI 10.1016/j.cor.2011.07.017
Citations Scopus - 28Web of Science - 20
Co-authors Hamish Waterer
2012 Boland NL, Eberhard AC, Engineer F, Tsoukalas A, 'A new approach to the feasibility pump in mixed integer programming', SIAM Journal on Optimization, 22 831-861 (2012) [C1]
DOI 10.1137/110823596
Citations Scopus - 6Web of Science - 5
2012 Boland NL, Gulczynski DJ, Savelsbergh MW, 'A stockyard planning problem', EURO Journal on Transportation and Logistics, 1 197-236 (2012) [C1]
2011 Baatar D, Boland NL, Brand S, Stuckey PJ, 'CP and IP approaches to cancer radiotherapy delivery optimization', Constraints, 16 173-194 (2011) [C1]
Citations Scopus - 8Web of Science - 4
2010 Bley A, Boland NL, Fricke C, Froyland G, 'A strengthened formulation and cutting planes for the open pit mine production scheduling problem', Computers and Operations Research, 37 1641-1647 (2010) [C1]
DOI 10.1016/j.cor.2009.12.008
Citations Scopus - 47Web of Science - 37
2009 Muhandiramge R, Boland NL, 'Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the Weight Constrained Shortest Path Problem', Networks, 53 358-381 (2009) [C1]
DOI 10.1002/net.20292
Citations Scopus - 11Web of Science - 7
2009 Wake GMGH, Boland N, Jennings LS, '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]
DOI 10.1016/j.cor.2007.10.027
Citations Scopus - 19Web of Science - 17
2009 Boland N, Dumitrescu I, Froyland G, Gleixner AM, '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]
DOI 10.1016/j.cor.2007.12.006
Citations Scopus - 75Web of Science - 48
2009 Muhandiramge R, Boland N, Wang S, 'CONVERGENT NETWORK APPROXIMATION FOR THE CONTINUOUS EUCLIDEAN LENGTH CONSTRAINED MINIMUM COST PATH PROBLEM', SIAM JOURNAL ON OPTIMIZATION, 20 54-77 (2009) [C1]
DOI 10.1137/070695356
Citations Scopus - 2Web of Science - 2
2009 Baatar D, Boland N, Johnston R, Hamacher HW, 'A New Sequential Extraction Heuristic for Optimizing the Delivery of Cancer Radiation Treatment Using Multileaf Collimators', INFORMS JOURNAL ON COMPUTING, 21 224-241 (2009) [C1]
DOI 10.1287/ijoc.1080.0288
Citations Scopus - 3Web of Science - 3
2008 Boland NL, Hughes BD, Merlot LTG, 'New integer linear programming approaches for course timetabling', Computers and Operations Research, 35 2209-2233 (2008) [C1]
DOI 10.1016/j.cor.2006.10.016
Citations Scopus - 21Web of Science - 13
2007 Baatar D, Boland N, Brand S, Stuckey PJ, '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, PROCEEDINGS, 4510 1-+ (2007) [C1]
Citations Scopus - 25Web of Science - 18
2007 Kallehauge B, Boland N, Madsen OBG, 'Path inequalities for the vehicle routing problem with time windows', NETWORKS, 49 273-293 (2007) [C1]
DOI 10.1002/net.20178
Citations Scopus - 13Web of Science - 9
2007 Mak V, Boland N, 'Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs', DISCRETE APPLIED MATHEMATICS, 155 2093-2110 (2007) [C1]
DOI 10.1016/j.dam.2007.05.014
Citations Scopus - 5Web of Science - 6
2006 Taylor S, Wanless IM, Boland NL, 'Distance domination and amplifier placement problems', Australasian Journal of Combinatorics, 34 117-136 (2006) [C1]

We consider the optimisation problem defined on a connected undirected graph with given root vertex and a parameter s, in which we seek a spanning tree with the smallest number of... [more]

We consider the optimisation problem defined on a connected undirected graph with given root vertex and a parameter s, in which we seek a spanning tree with the smallest number of special (amplifying) vertices such that each vertex in the tree is preceded on its unique path from the root vertex by an amplifying vertex no more than s edges distant. This problem, which we call the amplified spanning tree (AST) problem, is motivated by a practical problem in local access television cable networks. We show that even restricted to planar graphs with no vertex degree exceeding four, AST is NP-complete for every fixed s = 1. Making use of a connection with distance domination problems, we show that two related problems, including total distance domination, are also NP- complete and we derive an approximability upper bound for AST.

2006 Boland N, Dethridge J, Dumitrescu I, 'Accelerated label setting algorithms for the elementary resource constrained shortest path problem', OPERATIONS RESEARCH LETTERS, 34 58-68 (2006) [C1]
DOI 10.1016/j.orl.2004.11.011
Citations Scopus - 75Web of Science - 61
2006 Boland N, Dominguez-Marin P, Nickel S, Puerto J, 'Exact procedures for solving the discrete ordered median problem', COMPUTERS & OPERATIONS RESEARCH, 33 3270-3300 (2006) [C1]
DOI 10.1016/j.cor.2005.03.025
Citations Scopus - 29Web of Science - 25
2006 Mak V, Boland N, 'Facets of the polytope of the Asymmetric Travelling Salesman Problem with Replenishment Arcs', DISCRETE OPTIMIZATION, 3 33-49 (2006) [C1]
DOI 10.1016/j.disopt.2005.10.003
Citations Scopus - 3Web of Science - 3
2004 Boland N, Hamacher HW, Lenzen F, 'Minimizing beam-on time in cancer radiation treatment using multileaf collimators', NETWORKS, 43 226-240 (2004) [C1]
DOI 10.1002/net.20007
Citations Scopus - 61Web of Science - 55
2004 Boland N, Krishnamoorthy M, Ernst AT, Ebery J, 'Preprocessing and cutting for multiple allocation hub location problems', EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 155 638-653 (2004) [C1]
DOI 10.1016/S0377-2217(03)00072-9
Citations Scopus - 73Web of Science - 64
2004 Tran AV, Tucker RS, Boland NL, 'Amplifier placement methods for metropolitan WDM ring networks', JOURNAL OF LIGHTWAVE TECHNOLOGY, 22 2509-2522 (2004) [C1]
DOI 10.1109/JLT.2004.836744
Citations Scopus - 14Web of Science - 11
2003 Dumitrescu I, Boland N, 'Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem', NETWORKS, 42 135-153 (2003) [C1]
DOI 10.1002/net.10090
Citations Scopus - 91Web of Science - 80
2002 Davey B, Boland N, Stuckey PJ, 'Efficient intelligent backtracking using linear programming', INFORMS JOURNAL ON COMPUTING, 14 373-386 (2002)
DOI 10.1287/ijoc.14.4.373.2823
Citations Web of Science - 4
2001 Boland N, Surendonk T, '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
Citations Scopus - 2Web of Science - 2
2001 Boland N, Krishnamoorthy M, Stuckey P, 'Untitled - Preface', ANNALS OF OPERATIONS RESEARCH, 108 13-17 (2001)
2000 Neame P, Boland N, Ralph D, 'An outer approximate subdifferential method for piecewise affine optimization', MATHEMATICAL PROGRAMMING, 87 57-86 (2000)
Citations Scopus - 6Web of Science - 6
2000 Ebery J, Krishnamoorthy M, Ernst A, Boland N, '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
Citations Scopus - 133Web of Science - 110
2000 Boland NL, Clarke LW, Nemhauser GL, '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
Citations Scopus - 24Web of Science - 23
1998 Barnhart C, Boland NL, Clarke LW, Johnson EL, Nemhauser GL, Shenoi RG, 'Flight string models for aircraft fleeting and routing', TRANSPORTATION SCIENCE, 32 208-220 (1998)
DOI 10.1287/trsc.32.3.208
Citations Scopus - 171Web of Science - 141
1997 Boland NL, 'A dual-active-set algorithm for positive semi-definite quadratic programming', MATHEMATICAL PROGRAMMING, 78 1-27 (1997)
Citations Scopus - 17Web of Science - 15
1995 BOLAND NL, ERNST AT, GOH CJ, MEES AI, 'OPTIMAL 2-COMMODITY FLOWS WITH NONLINEAR COST-FUNCTIONS', JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 46 1192-1207 (1995)
1994 Boland NL, Ernst AT, Goh CJ, Mees AI, 'A faster version of the ASG algorithm', Applied Mathematics Letters, 7 23-27 (1994)
DOI 10.1016/0893-9659(94)90066-3
Citations Scopus - 3Web of Science - 3
1992 BOLAND N, GOH CJ, MEES AI, 'AN ALGORITHM FOR NONLINEAR NETWORK PROGRAMMING - IMPLEMENTATION, RESULTS AND COMPARISONS', JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 43 979-992 (1992)
DOI 10.1057/jors.1992.149
Citations Scopus - 8Web of Science - 3
1991 BOLAND N, GOH CJ, MEES AI, 'AN ALGORITHM FOR SOLVING QUADRATIC NETWORK FLOW PROBLEMS', APPLIED MATHEMATICS LETTERS, 4 61-64 (1991)
DOI 10.1016/0893-9659(91)90056-2
Citations Scopus - 6Web of Science - 6
1990 BOLAND N, MEES AI, 'NEW METHODS FOR MULTICOMMODITY FLOWS', COMPUTERS & MATHEMATICS WITH APPLICATIONS, 20 29-38 (1990)
DOI 10.1016/0898-1221(90)90066-S
Citations Scopus - 1Web of Science - 1
Show 65 more journal articles

Conference (32 outputs)

Year Citation Altmetrics Link
2017 Boland N, Hewitt M, Vu DM, Savelsbergh M, 'Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2017)

© Springer International Publishing AG 2017. The Traveling Salesman Problem with Time Windows is the problem of finding a minimum-cost path visiting each of a set of cities exact... [more]

© Springer International Publishing AG 2017. The Traveling Salesman Problem with Time Windows is the problem of finding a minimum-cost path visiting each of a set of cities exactly once, where each city must be visited within a specified time window. It has received significant attention because it occurs as a sub-problem in many real-life routing and scheduling problems. We explore an approach in which the strength of a time-expanded integer linear programming (IP) formulation is exploited without ever explicitly creating the complete formulation. The approach works with carefully designed partially time-expanded networks, which are used to produce upper as well as lower bounds, and which are iteratively refined until optimality is reached. Preliminary computational results illustrate the potential of the approach as, for almost all instances tested, optimal solutions can be identified in only a few iterations.

DOI 10.1007/978-3-319-59776-8_21
2015 Boland N, Kalinowski T, Rigterink F, 'Discrete flow pooling problems in coal supply chains' (2015) [E1]
Co-authors Thomas Kalinowski
2015 Horne A, Costa A, Boland N, Kaur S, Szemis J, Stewardson M, 'Developing a seasonal environmental watering tool', The Art and Science of Water - 36th Hydrology and Water Resources Symposium, HWRS 2015 (2015)

© 2015, Engineers Australia. All rights reserved. There is significant pressure on freshwater systems worldwide as consumptive demands for water increase relative to the availabl... [more]

© 2015, Engineers Australia. All rights reserved. There is significant pressure on freshwater systems worldwide as consumptive demands for water increase relative to the available resource, severely affecting flow regimes, and hence negatively impacting river ecosystems. A key element of Australia's approach to improve the ecological health of these systems has been large public investment in water entitlements. Management of these entitlements to achieve the best possible environmental outcomes requires ongoing active decision making on a season by season basis. These decisions include the delivery of water to competing environmental assets, the timing of these deliveries, the carryover of water to provide for the next season or the trade of water. These decisions are complex due to the multiple temporal and spatial scales. How this environmental water is managed in an efficient and transparent way, especially in the face of uncertainty in future rainfall locations and volumes, presents challenges. A potential tool to assist environmental managers to understand and assess this complex decision space is optimisation. Optimisation has been used in water resource management, mainly in long term planning of environmental and consumptive water use, however there has been limited focus on seasonal environmental watering decisions, and scant attention to making decisions that hedge against possible future stream flow realizations. Thus this paper describes the seasonal decision space (including the objectives, drivers, constraints and decisions available), and demonstrates how uncertainty in future rainfall and streamflow can be incorporated into a decision support tool.

2015 Boland N, Kalinowski T, Rigterink F, Savelsbergh M, 'A special case of the generalized pooling problem arising in the mining industry', ASOR Recent Advances in Operations Research (2015) [E3]
Co-authors Thomas Kalinowski
2015 Salehipour A, Savelsbergh M, Boland N, Ernst A, 'Approximating non-linear blending optimization in supply chain networks', CM3: New Challenges for the Greening of Transport: Book of Abstracts (2015) [E3]
Co-authors A Salehipour
2014 Boland N, Charkhgard H, Savelsbergh M, '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) (2014)

We present the first criterion space search algorithm, the triangle splitting method, for finding the efficient frontier of a biobjective mixed integer program. The algorithm is r... [more]

We present the first criterion space search algorithm, the triangle splitting method, for finding the efficient frontier of a biobjective mixed integer program. The algorithm is relatively easy to implement and converges quickly to the complete set of nondominated points. A computational study demonstrates the efficacy of the triangle splitting method. © 2014 Springer International Publishing Switzerland.

DOI 10.1007/978-3-319-07557-0_14
Citations Scopus - 2
2014 Belov G, Boland N, Savelsbergh MWP, Stuckey PJ, 'Local search for a cargo assembly planning problem', Integration of AI and OR Techniques in Constraint Programming. Lecture Notes in Computer Science (2014) [E1]
DOI 10.1007/978-3-319-07046-9_12
Citations Scopus - 2
2013 Boland NL, Kaur S, Kalinowski T, Kapoor R, 'Scheduling unit processing time arc shutdown jobs to maximize network flow over time', Proceedings of the 49th ANZIAM Conference (2013) [E3]
Co-authors Thomas Kalinowski
2013 Boland NL, Reisi M, Savelsbergh M, 'Demand driven throughput assessment for Hunter Valley Coal Chain', Proceedings of the 49th ANZIAM Conference (2013) [E3]
2013 Charkhgard H, Savelsbergh M, Boland N, 'A new algorithm for solving bi-objective 0-1 integer programs', Proceedings of the 49th ANZIAM Conference (2013) [E3]
2013 Talebian M, Boland N, Savelsbergh M, 'Pricing to accelerate demand learning in dynamic assortment planning', Proceedings of the 49th ANZIAM Conference (2013) [E3]
2013 Boland NL, Kaur S, 'A branch-and-bound algorithm for scheduling unit processing time arc shutdown jobs to maximize flow through a transshipment node over time', MODSIM2013, 20th International Congress on Modelling and Simulation (2013) [E1]
2013 Boland N, Ernst A, Kalinowski T, Rocha de Paula M, Savelsbergh M, Singh G, 'Time Aggregation for Network Design to Meet Time-Constrained Demand', MODSIM2013, 20th International Congress on Modelling and Simulation (2013) [E1]
Co-authors Thomas Kalinowski
2013 Boland NL, Bunder R, Heathcote A, 'Picking Items for Experimental Sets: Measures of Similarity and Methods for Optimisation', MODSIM2013, 20th International Congress on Modelling and Simulation (2013) [E1]
Co-authors Andrew Heathcote
2013 Clement R, Boland NL, Waterer H, 'A Variable Sized Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems', MODSIM2013, Proceedings of the 20th International Congress on Modelling and Simulation (2013) [E1]
Co-authors Hamish Waterer
2013 Boland NL, McGowan B, Mendes A, Rigterink F, 'Modelling the Capacity of the Hunter Valley Coal Chain to Support Capacity Alignment of Maintenance Activities', MODSIM2013, Proceedings of the 20th International Congress on Modelling and Simulation (2013) [E1]
Co-authors Alexandre Mendes
2013 Boland NL, 'On the augmented Lagrangian dual for integer programming', Proceedings of the 49th ANZIAM Conference (2013) [E3]
Citations Web of Science - 2
2013 Bunder RP, Boland NL, Heathcote AJ, 'An integer programming approach to picking items for experimental sets', Proceedings of the 49th ANZIAM Conference (2013) [E3]
Co-authors Andrew Heathcote
2013 Ruther S, Boland N, Engineer F, Evans I, '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 (2013)
2012 Boland NL, Evans I, Mears C, Niven T, Pattison M, Wallace M, Waterer HA, 'Rail disruption: Passenger focused recovery', Computers in Railways XIII (2012) [E1]
Co-authors Hamish Waterer
2012 Boland N, Engineer F, Evans I, Ruther S, 'Integrating the aircraft routing, crew pairing, and tail number assignment problem', 52nd AGIFORS Annual Proceedings 2012 - Symposium and Study Group Meeting (2012)
2011 Boland NL, Gulczynski DJ, Jackson MP, Savelsbergh MWP, Tam MK, 'Improved stockyard management strategies for coal export terminals at Newcastle', Proceedings of the 19th International Congress on Modelling and Simulation (2011) [E1]
Citations Scopus - 3Web of Science - 2
2011 Boland NL, Engineer F, Reisi Ardali M, Savelsbergh M, Waterer HA, 'Data generation in the Hunter Valley Coal Chain: A case study in capacity assessment', Proceedings of the 35th Application of Computers and Operations Research in the Minerals Industry Symposium (2011) [E1]
Co-authors Hamish Waterer
2011 Boland NL, Kalinowski T, Waterer H, Zheng L, 'An optimisation approach to maintenance scheduling for capacity alignment in the Hunter Valley coal chain', Proceedings of the 35th Application of Computers and Operations Research in the Minerals Industry Symposium (2011) [E1]
Citations Scopus - 2
Co-authors Thomas Kalinowski, Hamish Waterer
2011 Mendes ADS, Boland NL, 'Multi-objective optimisation of power restoration in electricity distribution systems', AI 2011: Advances in Artificial Intelligence 24th Australasian Joint Conference Perth, Australia, December 5-8, 2011 Proceedings (2011) [E1]
DOI 10.1007/978-3-642-25832-9_79
Citations Scopus - 1
Co-authors Alexandre Mendes
2011 Boland N, Engineer F, Evans I, Ruther S, 'Integrating the aircraft routing, crew pairing, and tail number assignment problem', 51st AGIFORS Annual Proceedings - Annual Symposium and Study Group Meeting, AGIFORS 2011 (2011)

Still work in progress. Challenge: large number of pricing problems. Gain flexibility by delaying scheduling decisions until 4 days before day of operations. Generates routes whil... [more]

Still work in progress. Challenge: large number of pricing problems. Gain flexibility by delaying scheduling decisions until 4 days before day of operations. Generates routes while considering the actual tail number and actual maintenance. Large number of pricing problems. Copyright © (2011) by AGIFORS.

2010 Mendes ADS, Boland NL, Guiney P, Riveros RC, '(N-1) contingency planning in radial distribution networks using genetic algorithms', 2010 IEEE/PES Transmission and Distribution. Proceedings (2010) [E1]
DOI 10.1109/TDC-LA.2010.5762896
Citations Scopus - 5
Co-authors Alexandre Mendes, Carlos Riveros
2009 Boland NL, 'Solving environmental problems with integer programming: Recent experience and challenges', The 18th World IMACS Congress and MODSIM09 International Congress on Modelling and Simulation: Proceedings (2009) [E1]
2005 Egudo R, Boland NL, Gan HS, 'A mathematical programming based decision support tool for force allocation', Proceedings of the 18th National Conference of the Australian Society for Operations Research (2005) [E1]
2005 Boland NL, Duane EJE, Gan HS, Helding M, 'Improving order picking efficiency through better warehouse design', Proceedings of the 18th National Conference of the Australian Society for Operations Research (2005) [E1]
1992 BOLAND NL, 'A DUAL-ACTIVE-SET ALGORITHM FOR POSITIVE SEMIDEFINITE QUADRATIC-PROGRAMMING', OPTIMIZATION : TECHNIQUES AND APPLICATIONS, VOLS 1 AND 2 (1992)
1992 GOH CJ, BOLAND NL, MEES AI, 'AN ALGORITHM FOR SOLVING QUADRATIC COST NETWORK FLOW OPTIMIZATION PROBLEMS', OPTIMIZATION : TECHNIQUES AND APPLICATIONS, VOLS 1 AND 2 (1992)
Show 29 more conferences

Report (1 outputs)

Year Citation Altmetrics Link
2013 Boland NL, Waterer H, Clement R, 'A big bucket time indexed formulation for non-preemptive single machine scheduling problems', Centre for Optimal Planning and Operations Report Series, 1 (2013) [R1]
Co-authors Hamish Waterer
Edit

Grants and Funding

Summary

Number of grants 16
Total funding $2,391,142

Click on a grant title below to expand the full details for that specific grant.


20141 grants / $234,800

Decomposition and Duality: New Approaches to Integer and Stochastic Integer Programming$234,800

Funding body: ARC (Australian Research Council)

Funding body ARC (Australian Research Council)
Project Team Professor Andrew Eberhard, Conjoint Professor Natashia Boland, Professor Jeffrey Linderoth
Scheme Discovery Projects
Role Lead
Funding Start 2014
Funding Finish 2016
GNo G1301358
Type Of Funding Aust Competitive - Commonwealth
Category 1CS
UON Y

20131 grants / $50,000

Integer Programming for Continuous Spaces$50,000

Funding body: University of Newcastle

Funding body University of Newcastle
Project Team Professor Martin Savelsbergh, Conjoint Professor Natashia Boland
Scheme Near Miss Grant
Role Investigator
Funding Start 2013
Funding Finish 2013
GNo G1300455
Type Of Funding Internal
Category INTE
UON Y

20121 grants / $4,800

Generating shipping stem data for PWCS terminals: modelling, methodology and data generation$4,800

Funding body: Port Waratah Coal Services Limited

Funding body Port Waratah Coal Services Limited
Project Team Conjoint Professor Natashia Boland
Scheme Research Project
Role Lead
Funding Start 2012
Funding Finish 2012
GNo G1200596
Type Of Funding Grant - Aust Non Government
Category 3AFG
UON Y

20113 grants / $950,000

Mathematics and Computing for Integrated Stockyard-centric Management of Mining Supply Chains$560,000

Funding body: ARC (Australian Research Council)

Funding body ARC (Australian Research Council)
Project Team Doctor Thomas Kalinowski, Conjoint Professor Natashia Boland, Professor Peter Stuckey, Doctor Alexandre Mendes, Doctor Faramroze Engineer, Professor Martin Savelsbergh, Dr Andreas Ernst
Scheme Linkage Projects
Role Investigator
Funding Start 2011
Funding Finish 2014
GNo G1000957
Type Of Funding Aust Competitive - Commonwealth
Category 1CS
UON Y

Mathematics and Computing for Integrated Stockyard-centric Management of Mining Supply Chains$260,000

Funding body: Hunter Valley Coal Chain Coordinator Limited

Funding body Hunter Valley Coal Chain Coordinator Limited
Project Team Conjoint Professor Natashia Boland, Professor Peter Stuckey, Doctor Alexandre Mendes, Doctor Faramroze Engineer, Professor Martin Savelsbergh, Dr Andreas Ernst, Doctor Thomas Kalinowski
Scheme Linkage Projects Partner Funding
Role Investigator
Funding Start 2011
Funding Finish 2013
GNo G1001065
Type Of Funding Grant - Aust Non Government
Category 3AFG
UON Y

Mathematics and Computing for Integrated Stockyard-centric Management of Mining Supply Chains$130,000

Funding body: Triple Point Australia

Funding body Triple Point Australia
Project Team Conjoint Professor Natashia Boland, Professor Peter Stuckey, Doctor Alexandre Mendes, Doctor Faramroze Engineer, Professor Martin Savelsbergh, Dr Andreas Ernst, Doctor Thomas Kalinowski
Scheme Linkage Projects Partner Funding
Role Investigator
Funding Start 2011
Funding Finish 2013
GNo G1001080
Type Of Funding Grant - Aust Non Government
Category 3AFG
UON Y

20102 grants / $40,000

Optimal Switching Strategies to maintain Load Balancing in No-Failure/Minimum-Impact Outage Scenarios$20,000

Funding body: Ausgrid

Funding body Ausgrid
Project Team Doctor Alexandre Mendes, Conjoint Professor Natashia Boland
Scheme Sponsorship Agreement
Role Investigator
Funding Start 2010
Funding Finish 2010
GNo G0900080
Type Of Funding Other Public Sector - State
Category 2OPS
UON Y

Mathematical Models and Algorithms for Optimizing the Design and Operations of Global Enterprise Logistics Networks$20,000

Funding body: University of Newcastle

Funding body University of Newcastle
Project Team Conjoint Professor Natashia Boland
Scheme Near Miss Grant
Role Lead
Funding Start 2010
Funding Finish 2010
GNo G0900208
Type Of Funding Internal
Category INTE
UON Y

20096 grants / $1,015,542

Methods and Software for efficiently solving the transportation crewing problem$336,681

Funding body: ARC (Australian Research Council)

Funding body ARC (Australian Research Council)
Project Team Conjoint Professor Natashia Boland
Scheme Linkage Projects
Role Lead
Funding Start 2009
Funding Finish 2012
GNo G0189529
Type Of Funding Aust Competitive - Commonwealth
Category 1CS
UON Y

Computer Assisted Research Mathematics and its Applications$267,361

Funding body: University of Newcastle

Funding body University of Newcastle
Project Team Laureate Professor Jon Borwein, Conjoint Professor Natashia Boland, Associate Professor Brailey Sims, Professor George Willis
Scheme Priority Research Centre
Role Investigator
Funding Start 2009
Funding Finish 2012
GNo G0189866
Type Of Funding Internal
Category INTE
UON Y

New Theory and Algorithms for Nonsmooth Optimization with Application to Integer Programming 18/5/2015 - Final report has been approved by ARC - Bec$249,000

Funding body: ARC (Australian Research Council)

Funding body ARC (Australian Research Council)
Project Team Conjoint Professor Natashia Boland, Laureate Professor Jon Borwein, Professor Andrew Eberhard
Scheme Discovery Projects
Role Lead
Funding Start 2009
Funding Finish 2011
GNo G0188718
Type Of Funding Aust Competitive - Commonwealth
Category 1CS
UON Y

Methods and Software for efficiently solving the transportation crewing problem$108,000

Funding body: Constraint Technologies International

Funding body Constraint Technologies International
Project Team Conjoint Professor Natashia Boland
Scheme Linkage Projects Partner Funding
Role Lead
Funding Start 2009
Funding Finish 2012
GNo G0189677
Type Of Funding Aust Competitive - Commonwealth
Category 1CS
UON Y

Algorithms for optimisation of the export coal supply chain$30,000

Funding body: Port Waratah Coal Services Limited

Funding body Port Waratah Coal Services Limited
Project Team Conjoint Professor Natashia Boland
Scheme Research Sponsorship Scholarship
Role Lead
Funding Start 2009
Funding Finish 2011
GNo G0190248
Type Of Funding Grant - Aust Non Government
Category 3AFG
UON Y

Optimizing the design of minigrid electricity networks$24,500

Funding body: CSIRO - Energy Technology

Funding body CSIRO - Energy Technology
Project Team Conjoint Professor Natashia Boland
Scheme Postgraduate Research Scholarship
Role Lead
Funding Start 2009
Funding Finish 2012
GNo G0190511
Type Of Funding Other Public Sector - Commonwealth
Category 2OPC
UON Y

20082 grants / $96,000

Coal Chain modelling and optimization$66,000

Funding body: Newcastle Innovation

Funding body Newcastle Innovation
Project Team Conjoint Professor Natashia Boland
Scheme Administered Research
Role Lead
Funding Start 2008
Funding Finish 2008
GNo G0189697
Type Of Funding Internal
Category INTE
UON Y

Algorithms for Integrated Airline Planning$30,000

Funding body: Constraint Technologies International

Funding body Constraint Technologies International
Project Team Conjoint Professor Natashia Boland
Scheme Research Sponsorship Scholarship
Role Lead
Funding Start 2008
Funding Finish 2010
GNo G0189269
Type Of Funding Contract - Aust Non Government
Category 3AFC
UON Y
Edit

Research Supervision

Number of supervisions

Completed8
Current0

Past Supervision

Year Level of Study Research Title Program Supervisor Type
2017 PhD Pooling Problems: Advances in Theory and Applications PhD (Mathematics), Faculty of Science, The University of Newcastle Co-Supervisor
2016 PhD Theory and Algorithms for Multi-objective Integer Programming PhD (Mathematics), Faculty of Science, The University of Newcastle Co-Supervisor
2015 PhD Mixed Integer Linear Programming Models for Machine Scheduling PhD (Mathematics), Faculty of Science, The University of Newcastle Principal Supervisor
2015 PhD Optimising Throughput in the Hunter Valley Coal Chain Using Integer Programming Techniques PhD (Mathematics), Faculty of Science, The University of Newcastle Principal Supervisor
2015 PhD Scheduling Problems Arising in Coal Export Supply Chains: Algorithms and Complexity PhD (Mathematics), Faculty of Science, The University of Newcastle Co-Supervisor
2015 PhD Arc Shutdown Scheduling in a Capacitated Network to Maximize Flow Over Time PhD (Mathematics), Faculty of Science, The University of Newcastle Principal Supervisor
2014 PhD Mixed-Integer Quadratically-Constrained Programming, Piecewise-Linear Approximation and Error Analysis with Applications in Power Flow PhD (Mathematics), Faculty of Science, The University of Newcastle Principal Supervisor
2013 PhD Integrated Aircraft Routing, Crew Pairing, and Tail Assignment PhD (Mathematics), Faculty of Science, The University of Newcastle Principal Supervisor
Edit

Conjoint Professor Natashia Boland

Position

Conjoint Professor
School of Mathematical and Physical Sciences
Faculty of Science

Focus area

Mathematics

Contact Details

Email natashia.boland@newcastle.edu.au

Office

Room .
Edit