Natashia Boland

Publication Activity (10 Years)

Years Active: 2000-2023
Publications (10 Years): 44

Top Topics

Discrete Optimization Problems

Integer Program

Top Venues

INFORMS J. Comput.

Eur. J. Oper. Res.

Publications

Stephan Helfrich, Tyler A. Perini, Pascal Halffmann, Natashia Boland, Stefan Ruzika
Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems. J. Glob. Optim. 86 (2) (2023)
Ahmad Baubaid, Natashia Boland, Martin W. P. Savelsbergh
The Dynamic Freight Routing Problem for Less-Than-Truckload Carriers. Transp. Sci. 57 (3) (2023)
Merve Bodur, Shabbir Ahmed, Natashia Boland, George L. Nemhauser
Decomposition of loosely coupled integer programs: a multiobjective perspective. Math. Program. 196 (1) (2022)
Yu Yang, Yassine Ridouane, Natashia Boland, Alan L. Erera, Martin W. P. Savelsbergh
Substitution-based equipment balancing in service networks with multiple equipment types. Eur. J. Oper. Res. 300 (3) (2022)
Edward Yuhang He, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh
Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems. INFORMS J. Comput. 34 (2) (2022)
Felipe Lagos, Natashia Boland, Martin W. P. Savelsbergh
Dynamic discretization discovery for solving the Continuous Time Inventory Routing Problem with Out-and-Back Routes. Comput. Oper. Res. 141 (2022)
Edward He, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh
An exact algorithm for the service network design problem with hub capacity constraints. Networks 80 (4) (2022)
Baris Yildiz, Natashia Boland, Martin W. P. Savelsbergh
Decomposition Branching for Mixed Integer Programming. Oper. Res. 70 (3) (2022)
Mehran Navabi-Shirazi, Mohamed El Tonbari, Natashia Boland, Dima Nazzal, Lauren N. Steimle
Multicriteria Course Mode Selection and Classroom Assignment Under Sudden Space Scarcity. Manuf. Serv. Oper. Manag. 24 (6) (2022)
Yu Yang, Natashia Boland, Bistra Dilkina, Martin W. P. Savelsbergh
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems. Eur. J. Oper. Res. 301 (3) (2022)
Ian Herszterg, Yassine Ridouane, Natashia Boland, Alan L. Erera, Martin W. P. Savelsbergh
Near real-time loadplan adjustments for less-than-truckload carriers. Eur. J. Oper. Res. 301 (3) (2022)
Ahmad Baubaid, Natashia Boland, Martin W. P. Savelsbergh
The Value of Limited Flexibility in Service Network Designs. Transp. Sci. 55 (1) (2021)
Edward He, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh
Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting. INFORMS J. Comput. 33 (3) (2021)
Natashia Boland, Riley Clement, Hamish Waterer
28(1): 14-30, 2016. INFORMS J. Comput. 33 (2) (2021)
Yu Yang, Natashia Boland, Martin W. P. Savelsbergh
Multivariable Branching: A 0-1 Knapsack Problem Case Study. INFORMS J. Comput. 33 (4) (2021)
Luke Marshall, Natashia Boland, Martin W. P. Savelsbergh, Mike Hewitt
Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem. Transp. Sci. 55 (1) (2021)
Felipe Lagos, Natashia Boland, Martin W. P. Savelsbergh
The Continuous-Time Inventory-Routing Problem. Transp. Sci. 54 (2) (2020)
Ilke Bakir, Natashia Boland, Brian C. Dandurand, Alan L. Erera
Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs. INFORMS J. Comput. 32 (1) (2020)
Tyler A. Perini, Natashia Boland, Diego Pecin, Martin W. P. Savelsbergh
A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method. INFORMS J. Comput. 32 (1) (2020)
Duc Minh Vu, Mike Hewitt, Natashia Boland, Martin W. P. Savelsbergh
Dynamic Discretization Discovery for Solving the Time-Dependent Traveling Salesman Problem with Time Windows. Transp. Sci. 54 (3) (2020)
Natashia Boland, Jeffrey Christiansen, Brian C. Dandurand, Andrew C. Eberhard, Fabricio Oliveira
A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems. Math. Program. 175 (1-2) (2019)
Natashia Boland, Mike Hewitt, Luke Marshall, Martin W. P. Savelsbergh
The price of discretizing time: a study in service network design. EURO J. Transp. Logist. 8 (2) (2019)
Mateus Rocha de Paula, Natashia Boland, Andreas T. Ernst, Alexandre Mendes, Martin W. P. Savelsbergh
Throughput optimisation in a coal export system with multiple terminals and shared resources. Comput. Ind. Eng. 134 (2019)
Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh
Preprocessing and cut generation techniques for multi-objective binary programming. Eur. J. Oper. Res. 274 (3) (2019)
Ahmad Baubaid, Natashia Boland, Martin W. P. Savelsbergh
Dealing with Demand Uncertainty in Service Network and Load Plan Design. CPAIOR (2018)
Edward He, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh
A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem. CPAIOR (2018)
Natashia Boland, Jeffrey Christiansen, Brian C. Dandurand, Andrew C. Eberhard, Jeff T. Linderoth, James R. Luedtke, Fabricio Oliveira
Combining Progressive Hedging with a Frank-Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming. SIAM J. Optim. 28 (2) (2018)
Mateus Rocha de Paula, Natashia Boland, Andreas T. Ernst, Alexandre Mendes, Martin W. P. Savelsbergh
Maximising Throughput in a Complex Coal Export System. CoRR (2018)
Natashia Boland, Mike Hewitt, Duc Minh Vu, Martin W. P. Savelsbergh
Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks. CPAIOR (2017)
Natashia Boland, Santanu S. Dey, Thomas Kalinowski, Marco Molinaro, Fabian Rigterink
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions. Math. Program. 162 (1-2) (2017)
Natashia Boland, Mike Hewitt, Luke Marshall, Martin W. P. Savelsbergh
The Continuous-Time Service Network Design Problem. Oper. Res. 65 (5) (2017)
Avril C. Horne, Simranjit Kaur, Joanna M. Szemis, Alysson M. Costa, J. Angus Webb, Rory Nathan, Michael J. Stewardson, Lisa L. Lowe, Natashia Boland
Using optimization to develop a "designer" environmental flow regime. Environ. Model. Softw. 88 (2017)
Natashia Boland, Thomas Kalinowski, Fabian Rigterink
A polynomially solvable case of the pooling problem. J. Glob. Optim. 67 (3) (2017)
Sebastian Ruther, Natashia Boland, Faramroze G. Engineer, Ian Evans
Integrated Aircraft Routing, Crew Pairing, and Tail Assignment: Branch-and-Price with Many Pricing Problems. Transp. Sci. 51 (1) (2017)
Claudia Archetti, Natashia Boland, M. Grazia Speranza
A Matheuristic for the Multivehicle Inventory Routing Problem. INFORMS J. Comput. 29 (3) (2017)
Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh
The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs. Eur. J. Oper. Res. 260 (3) (2017)
Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh
A new method for optimizing a linear function over the efficient set of a multiobjective integer program. Eur. J. Oper. Res. 260 (3) (2017)
Natashia Boland, Riley Clement, Hamish Waterer
A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems. INFORMS J. Comput. 28 (1) (2016)
Natashia Boland, Matteo Fischetti, Michele Monaci, Martin W. P. Savelsbergh
Proximity Benders: a decomposition heuristic for stochastic programs. J. Heuristics 22 (2) (2016)
Avril C. Horne, Joanna M. Szemis, Simranjit Kaur, J. Angus Webb, Michael J. Stewardson, Alysson M. Costa, Natashia Boland
Optimization tools for environmental water decisions: A review of strengths, weaknesses, and opportunities to improve adoption. Environ. Model. Softw. 84 (2016)
Natashia Boland, Irina Dumitrescu, Gary Froyland, Thomas Kalinowski
Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming. Math. Program. 157 (1) (2016)
Natashia 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. J. Comb. Optim. 32 (3) (2016)
Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh
-shape search method for triobjective integer programming. Math. Program. Comput. 8 (2) (2016)
Natashia Boland, Thomas Kalinowski, Fabian Rigterink
New multi-commodity flow formulations for the pooling problem. J. Glob. Optim. 66 (4) (2016)
Natashia Boland, Thomas Kalinowski, Fabian Rigterink
A polynomially solvable case of the pooling problem. CoRR (2015)
Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh
A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method. INFORMS J. Comput. 27 (4) (2015)
Natashia Boland, Martin W. P. Savelsbergh, Hamish Waterer
A decision support tool for generating shipping data for the Hunter Valley coal chain. Comput. Oper. Res. 53 (2015)
Natashia Boland, Andrew C. Eberhard, Angelos Tsoukalas
A Trust Region Method for the Solution of the Surrogate Dual in Integer Programming. J. Optim. Theory Appl. 167 (2) (2015)
Natashia Boland, Thomas Kalinowski, Simranjit Kaur
Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies. Comput. Oper. Res. 64 (2015)
Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh
A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method. INFORMS J. Comput. 27 (4) (2015)
Natashia Boland, Reena Kapoor, Simranjit Kaur, Thomas Kalinowski
Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results. Networks 63 (2) (2014)
Gleb Belov, Natashia Boland, Martin W. P. Savelsbergh, Peter J. Stuckey
Local Search for a Cargo Assembly Planning Problem. CPAIOR (2014)
Masoud Talebian, Natashia Boland, Martin W. P. Savelsbergh
Pricing to accelerate demand learning in dynamic assortment planning for perishable products. Eur. J. Oper. Res. 237 (2) (2014)
Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh
The Triangle Splitting Method for Biobjective Mixed Integer Programming. IPCO (2014)
Natashia Boland, Thomas Kalinowski, Hamish Waterer, Lanbo Zheng
Scheduling arc maintenance jobs in a network to maximize total flow over time. Discret. Appl. Math. 163 (2014)
Kerem Akartunali, Natashia Boland, Ian Evans, Mark Wallace, Hamish Waterer
Airline planning benchmark problems - Part I: : Characterising networks and demand using limited data. Comput. Oper. Res. 40 (3) (2013)
Natashia Boland, Thomas Kalinowski, Reena Kapoor, Simranjit Kaur
Scheduling unit processing time arc shutdown jobs to maximize network flow over time: complexity results. CoRR (2013)
Mark Wallace, Natashia Boland, Edmund K. Burke
Transport scheduling: Meeting the challenges of scale, complexity and uncertainty. Comput. Oper. Res. 40 (3) (2013)
Kerem Akartunali, Natashia Boland, Ian Evans, Mark Wallace, Hamish Waterer
Airline planning benchmark problems - Part II: Passenger groups, utility and demand allocation. Comput. Oper. Res. 40 (3) (2013)
Natashia Boland, Thomas Kalinowski, Hamish Waterer, Lanbo Zheng
Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain. J. Sched. 16 (6) (2013)
Natashia 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. CoRR (2013)
Olivia J. Smith, Natashia Boland, Hamish Waterer
Solving shortest path problems with a weight constraint and replenishment arcs. Comput. Oper. Res. 39 (5) (2012)
Natashia Boland, Damon Gulczynski, Martin W. P. Savelsbergh
A stockyard planning problem. EURO J. Transp. Logist. 1 (3) (2012)
Natashia Boland, Andreas Bley, Christopher Fricke, Gary Froyland, Renata Sotirov
Clique-based facets for the precedence constrained knapsack problem. Math. Program. 133 (1-2) (2012)
Alexandre Mendes, Natashia Boland
Multi-objective Optimisation of Power Restoration in Electricity Distribution Systems. Australasian Conference on Artificial Intelligence (2011)
Davaatseren Baatar, Natashia Boland, Sebastian Brand, Peter J. Stuckey
CP and IP approaches to cancer radiotherapy delivery optimization. Constraints An Int. J. 16 (2) (2011)
Andreas Bley, Natashia Boland, Christopher Fricke, Gary Froyland
A strengthened formulation and cutting planes for the open pit mine production scheduling problem. Comput. Oper. Res. 37 (9) (2010)
Giulia M. G. H. Wake, Natashia Boland, Les S. Jennings
Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators. Comput. Oper. Res. 36 (3) (2009)
Davaatseren Baatar, Natashia Boland, Robert Johnston, Horst W. Hamacher
A New Sequential Extraction Heuristic for Optimizing the Delivery of Cancer Radiation Treatment Using Multileaf Collimators. INFORMS J. Comput. 21 (2) (2009)
Ranga Muhandiramge, Natashia Boland, Song Wang
Convergent Network Approximation for the Continuous Euclidean Length Constrained Minimum Cost Path Problem. SIAM J. Optim. 20 (1) (2009)
Natashia Boland, Irina Dumitrescu, Gary Froyland, Ambros M. Gleixner
LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity. Comput. Oper. Res. 36 (4) (2009)
Ranga Muhandiramge, Natashia Boland
Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem. Networks 53 (4) (2009)
Natashia Boland, Barry D. Hughes, Liam T. G. Merlot, Peter J. Stuckey
New integer linear programming approaches for course timetabling. Comput. Oper. Res. 35 (7) (2008)
Brian Kallehauge, Natashia Boland, Oli B. G. Madsen
Path inequalities for the vehicle routing problem with time windows. Networks 49 (4) (2007)
Davaatseren Baatar, Natashia Boland, Sebastian Brand, Peter J. Stuckey
Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches. CPAIOR (2007)
Vicky Mak, Natashia Boland
Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs. Discret. Appl. Math. 155 (16) (2007)
Natashia Boland, John Dethridge, Irina Dumitrescu
Accelerated label setting algorithms for the elementary resource constrained shortest path problem. Oper. Res. Lett. 34 (1) (2006)
Vicky Mak, Natashia Boland
Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs. Discret. Optim. 3 (1) (2006)
Natashia Boland, Patricia Domínguez-Marín, Stefan Nickel, Justo Puerto
Exact procedures for solving the discrete ordered median problem. Comput. Oper. Res. 33 (11) (2006)
Natashia Boland, Mohan Krishnamoorthy, Andreas T. Ernst, Jamie Ebery
Preprocessing and cutting for multiple allocation hub location problems. Eur. J. Oper. Res. 155 (3) (2004)
Natashia Boland, Horst W. Hamacher, Frank Lenzen
Minimizing beam-on time in cancer radiation treatment using multileaf collimators. Networks 43 (4) (2004)
Irina Dumitrescu, Natashia Boland
Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem. Networks 42 (3) (2003)
Bruce Davey, Natashia Boland, Peter J. Stuckey
Efficient Intelligent Backtracking Using Linear Programming. INFORMS J. Comput. 14 (4) (2002)
Liam T. G. Merlot, Natashia Boland, Barry D. Hughes, Peter J. Stuckey
A Hybrid Algorithm for the Examination Timetabling Problem. PATAT (2002)
Natashia Boland, Timothy J. Surendonk
A Column Generation Approach to Delivery Planning over Time with Inhomogeneous Service Providers and Service Interval Constraints. Ann. Oper. Res. 108 (1-4) (2001)
Philip J. Neame, Natashia Boland, Daniel Ralph
An outer approximate subdifferential method for piecewise affine optimization. Math. Program. 87 (1) (2000)
Jamie Ebery, Mohan Krishnamoorthy, Andreas T. Ernst, Natashia Boland
The capacitated multiple allocation hub location problem: Formulations and algorithms. Eur. J. Oper. Res. 120 (3) (2000)