Natashia Boland | Academic Influence

Natashia Boland's AcademicInfluence.com Rankings

Natashia Boland

Mathematics

#5718

World Rank

#8029

Historical Rank

Measure Theory

#3368

World Rank

#3978

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Natashia Boland's Degrees

PhD Mathematics Princeton University
Masters Mathematics Stanford University
Bachelors Mathematics University of California, Berkeley

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Natashia Boland Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Natashia Lesley Boland is a professor of mathematics at Georgia Institute of Technology. Boland completed a PhD at the University of Western Australia in 1992, and afterwards she pursued postdoctoral research at the University of Waterloo in Canada, at the Georgia Institute of Technology in the USA. She spent 13 years at the University of Melbourne and then from 2008 to 2014 worked at the University of Newcastle. She has made contributions to transportation scheduling, modeling of infrastructure networks, planning pricing strategies for demand, and optimization for environmental modeling.

(See a Problem?)

Natashia Boland's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Flight String Models for Aircraft Fleeting and Routing (1998) (363)
The capacitated multiple allocation hub location problem: Formulations and algorithms (2000) (288)
A Hybrid Algorithm for the Examination Timetabling Problem (2002) (246)
Improved preprocessing, labeling and scaling algorithms for the Weight‐Constrained Shortest Path Problem (2003) (220)
Accelerated label setting algorithms for the elementary resource constrained shortest path problem (2006) (198)
LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity (2009) (163)
Preprocessing and cutting for multiple allocation hub location problems (2004) (142)
A strengthened formulation and cutting planes for the open pit mine production scheduling problem (2010) (120)
Minimizing beam‐on time in cancer radiation treatment using multileaf collimators (2004) (119)
The Continuous-Time Service Network Design Problem (2017) (115)
A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method (2015) (95)
Algorithms for the Weight Constrained Shortest Path Problem (2001) (83)
Exact procedures for solving the discrete ordered median problem (2006) (83)
Solving shortest path problems with a weight constraint and replenishment arcs (2012) (75)
A Multistage Stochastic Programming Approach to Open Pit Mine Production Scheduling with Uncertain Geology (2008) (74)
A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method (2015) (71)
The L-shape search method for triobjective integer programming (2016) (63)
The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs (2017) (61)
New integer linear programming approaches for course timetabling (2008) (57)
Comparison of Mixed-Integer Programming and Genetic Algorithm Methods for Distributed Generation Planning (2014) (56)
A Matheuristic for the Multivehicle Inventory Routing Problem (2017) (54)
Switch and Tap-Changer Reconfiguration of Distribution Networks Using Evolutionary Algorithms (2013) (51)
The asymmetric traveling salesman problem with replenishment arcs (2000) (49)
Using optimization to develop a "designer" environmental flow regime (2017) (48)
Combining Progressive Hedging with a Frank-Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming (2017) (48)
Optimization tools for environmental water decisions: A review of strengths, weaknesses, and opportunities to improve adoption (2016) (47)
Path inequalities for the vehicle routing problem with time windows (2007) (47)
A new method for optimizing a linear function over the efficient set of a multiobjective integer program (2017) (46)
Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches (2007) (44)
Dynamic Discretization Discovery for Solving the Time-Dependent Traveling Salesman Problem with Time Windows (2020) (44)
A stockyard planning problem (2012) (41)
Heuristic approaches to the asymmetric travelling salesman problem with replenishment arcs (2000) (39)
A dual-active-set algorithm for positive semi-definite quadratic programming (1997) (39)
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions (2015) (36)
Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain (2013) (34)
Optimizing the Hunter Valley Coal Chain (2012) (34)
Boosting the feasibility pump (2014) (32)
Scheduling arc maintenance jobs in a network to maximize total flow over time (2014) (32)
Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators (2009) (30)
Integrated Aircraft Routing, Crew Pairing, and Tail Assignment: Branch-and-Price with Many Pricing Problems (2017) (29)
New multi-commodity flow formulations for the pooling problem (2016) (28)
Proximity Benders: a decomposition heuristic for stochastic programs (2016) (28)
Pricing to Accelerate Demand Learning in Dynamic Assortment Planning for Perishable Products (2013) (27)
A New Approach to the Feasibility Pump in Mixed Integer Programming (2012) (27)
Solving mixed integer nonlinear programming problems for mine production planning with stockpiling (2012) (25)
Perspectives on integer programming for time-dependent models (2019) (23)
A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems (2017) (22)
Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem (2009) (22)
The price of discretizing time: a study in service network design (2019) (22)
The Continuous-Time Inventory-Routing Problem (2020) (21)
Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks (2017) (21)
Efficient Intelligent Backtracking Using Linear Programming (2002) (21)
Clique-based facets for the precedence constrained knapsack problem (2012) (20)
For the Common Good? New Zealanders Comply with Quality Standards (1998) (19)
A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method (2020) (19)
Throughput optimisation in a coal export system with multiple terminals and shared resources (2019) (19)
The Triangle Splitting Method for Biobjective Mixed Integer Programming (2014) (18)
Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (2007) (18)
On the augmented Lagrangian dual for integer programming (2015) (18)
Amplifier placement methods for metropolitan WDM ring networks (2004) (18)
Solving Time Dependent Traveling Salesman Problems with Time Windows (2018) (16)
Logistics optimization for a coal supply chain (2020) (16)
An algorithm for solving quadratic network flow problems | NOVA. The University of Newcastle's Digital Repository (1991) (15)
Finding an Optimal Stationing Policy for the US Army in Europe After the Force Drawdown (1996) (15)
A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems (2016) (13)
Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming (2016) (13)
CP and IP approaches to cancer radiotherapy delivery optimization (2011) (13)
Scenario Set Partition Dual Bounds for Multistage Stochastic Programming : A Hierarchy of Bounds and a Partition Sampling Approach (2016) (13)
Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem (2020) (12)
Local Search for a Cargo Assembly Planning Problem (2014) (11)
Optimizing wind farm siting to reduce power system impacts of wind variability (2019) (11)
Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies (2014) (11)
Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems (2021) (11)
A special case of the generalized pooling problem arising in the mining industry * (2014) (11)
An outer approximate subdifferential method for piecewise affine optimization (2000) (10)
(N-1) contingency planning in radial distribution networks using genetic algorithms (2010) (10)
A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem (2018) (10)
A polynomially solvable case of the pooling problem (2015) (10)
Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results (2013) (9)
Improved stockyard management strategies for coal export terminal at Newcastle (2011) (9)
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period (2013) (9)
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems (2022) (9)
A New Sequential Extraction Heuristic for Optimizing the Delivery of Cancer Radiation Treatment Using Multileaf Collimators (2009) (8)
Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs (2006) (8)
Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs (2020) (8)
Active Management of Environmental Water to Improve Ecological Outcomes (2018) (8)
Decomposition of loosely coupled integer programs: a multiobjective perspective (2022) (8)
Convergent Network Approximation for the Continuous Euclidean Length Constrained Minimum Cost Path Problem (2009) (7)
Airline planning benchmark problems - Part II: Passenger groups, utility and demand allocation (2013) (7)
Multivariable Branching: A 0-1 Knapsack Problem Case Study (2021) (7)
A Simple and Efficient Algorithm For Solving Three Objective Integer Programs (2014) (7)
An optimisation approach to maintenance scheduling for capacity alignment in the Hunter Valley coal chain (2011) (7)
A Faster Version of the ASG Algorithm (1994) (6)
Preprocessing and cut generation techniques for multi-objective binary programming (2019) (6)
A Column Generation Approach to Delivery Planning over Time with Inhomogeneous Service Providers and Service Interval Constraints (2001) (6)
A decision support tool for generating shipping data for the Hunter Valley coal chain (2015) (6)
Computational Complexity of Time-Dependent Shortest Path Problems (2019) (5)
Airline planning benchmark problems - Part I: : Characterising networks and demand using limited data (2013) (5)
Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting (2020) (5)
Dynamic discretization discovery for solving the Continuous Time Inventory Routing Problem with Out-and-Back Routes (2022) (4)
Shipping Data Generation for the Hunter Valley Coal Chain ∗ (2013) (4)
The Value of Limited Flexibility in Service Network Designs (2020) (4)
Decomposition Branching for Mixed Integer Programming (2022) (3)
A Trust Region Method for the Solution of the Surrogate Dual in Integer Programming (2015) (3)
Discrete flow pooling problems in coal supply chains (2015) (3)
Modelling the Capacity of the Hunter Valley Coal Chain to Support Capacity Alignment of Maintenance Activities (2013) (3)
Biobjective mixed integer programs instances (2013) (3)
Optimal Two-commodity Flows with Non-linear Cost Functions (1995) (2)
A big bucket time indexed formulation for nonpreemptive single machine scheduling problems (2013) (2)
Exploration of models for a cargo assembly planning problem (2015) (2)
Solving environmental problems with integer programming: recent experience and challenges | NOVA. The University of Newcastle's Digital Repository (2009) (2)
Assortment and Pricing with Demand Learning (2012) (2)
On the behaviour of robots through singularities (1988) (2)
Exact and heuristic approaches to the budget-constrained dynamic uncapacitated facility location-network design problem (2012) (2)
Near real-time loadplan adjustments for less-than-truckload carriers (2021) (2)
Time aggregation for network design to meet time-constrained demand (2013) (2)
Data generation in the Hunter Valley Coal Chain: a case study in capacity assessment (2011) (2)
Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming (2016) (2)
Multi-objective Optimisation of Power Restoration in Electricity Distribution Systems (2011) (2)
On the Existence of Ideal Solutions in Multi-objective 0-1 Integer Programs (2016) (1)
Scheduling unit processing time arc shutdown jobs to maximize network flow over time: complexity results (2013) (1)
Clique-based facets for the precedence constrained knapsack problem (2011) (1)
New methods for multi-commodity flows (1990) (1)
Optimization to Support Seasonal Environmental Watering Decisions (2016) (1)
New multi-commodity flow formulations for the pooling problem (2016) (1)
Multicriteria Course Mode Selection and Classroom Assignment Under Sudden Space Scarcity (2022) (1)
Substitution-based equipment balancing in service networks with multiple equipment types (2021) (1)
A Fast and Robust Algorithm for Solving Biobjective Mixed Integer Programs (2021) (0)
A polynomially solvable case of the pooling problem (2016) (0)
Rail disruption: passenger focused recovery (2012) (0)
Improving order picking efficiency through better warehouse design (2005) (0)
Efficient design of WDM ring networks with optical amplifiers (2001) (0)
Perspectives on integer programming for time-dependent models (2019) (0)
Multiple activation strategy for the ASG algorithm (1994) (0)
Multi-Variable Branching: A 0-1 Knapsack Problem Case Study (2020) (0)
Dominance in Pricing Problems with Stochasticity (2015) (0)
Scheduling in the manufacture of evaporative air conditioners (1995) (0)
Transport scheduling: Meeting the challenges of scale, complexity and uncertainty (2013) (0)
Akartunali, Kerem and Boland, Natashia and Evans, Ian and Wallace, Mark and Waterer, Hamish (2013) Airline planning benchmark problems (2018) (0)
The L-shape search method for triobjective integer programming (2015) (0)
Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain (2012) (0)
Picking items for experimental sets: measures of similarity and methods for optimisation (2013) (0)
Proximity Benders: a decomposition heuristic for stochastic programs (2015) (0)
Precedence constrained knapsack problem data instances (2010) (0)
Optimal 2-commodity flows with nonlinear cost functions (1995) (0)
Dealing with Demand Uncertainty in Service Network and Load Plan Design (2018) (0)
A Variable Sized Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems (2013) (0)
A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems (2018) (0)
A Ship Routing Problem with Hold and Draft Constraints Charity (2009) (0)
Corrigendum to "A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems, " INFORMS Journal on Computing 28(1): 14-30, 2016 (2020) (0)
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period (2015) (0)
On the Relationship Between the Value Function and the Efficient Frontier of a Mixed Integer Linear Optimization Problem (2023) (0)
A mathematical programming based decision support tool for force allocation (2005) (0)
Rejoinder on: Perspectives on integer programming for time-dependent models (2019) (0)
Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems (2023) (0)
Logistics optimization for a coal supply chain (2020) (0)
A branch-and-bound algorithm for scheduling unit processing time arc shutdown jobs to maximize flow through a transshipment node over time (2013) (0)
Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programming and a Bounds Hierarchy (2020) (0)
Maximising Throughput in a Complex Coal Export System (2018) (0)
An exact algorithm for the service network design problem with hub capacity constraints (2022) (0)
The Dynamic Freight Routing Problem for Less-Than-Truckload Carriers (2022) (0)
Distance domination and amplifier placement problems (2006) (0)
C++ implementation of the algorithms given in the journal article “A New Method for Optimising a Linear Function over the Efficient Set of a Multi-objective Integer Program" (2015) (0)
Piecewise Linear Models (2017) (0)
Short-Term Inventory-Aware Equipment Management in Service Networks (2020) (0)
Developing a seasonal environmental watering tool (2015) (0)
Boosting the feasibility pump (2014) (0)
Rejoinder on: Perspectives on integer programming for time-dependent models (2019) (0)
The Value of Limited Flexibility in Stochastic Load Planning and Service Network Design (2019) (0)
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions (2016) (0)

This paper list is powered by the following services:

Other Resources About Natashia Boland

en.wikipedia.org

What Schools Are Affiliated With Natashia Boland?

Natashia Boland is affiliated with the following schools: