A dual-active-set algorithm for positive semi-definite quadratic programming. - Natashia L. Boland (Math. Program., 1997)

Flight String Models for Aircraft Fleeting and Routing. - Cynthia Barnhart; Natashia L. Boland; Lloyd W. Clarke; Ellis L. Johnson; George L. Nemhauser; Rajesh G. Shenoi (Transp. Sci., 1998)

The asymmetric traveling salesman problem with replenishment arcs. - Natashia L. Boland; Lloyd W. Clarke; George L. Nemhauser (Eur. J. Oper. Res., 2000)

The capacitated multiple allocation hub location problem: Formulations and algorithms. - Jamie Ebery; Mohan Krishnamoorthy; Andreas T. Ernst; Natashia Boland (Eur. J. Oper. Res., 2000)

An outer approximate subdifferential method for piecewise affine optimization. - Philip J. Neame; Natashia Boland; Daniel Ralph (Math. Program., 2000)

A Column Generation Approach to Delivery Planning over Time with Inhomogeneous Service Providers and Service Interval Constraints. - Natashia Boland; Timothy J. Surendonk (Ann. Oper. Res., 2001)

A Hybrid Algorithm for the Examination Timetabling Problem. - Liam T. G. Merlot; Natashia Boland; Barry D. Hughes; Peter J. Stuckey (PATAT, 2002)

Efficient Intelligent Backtracking Using Linear Programming. - Bruce Davey; Natashia Boland; Peter J. Stuckey (INFORMS J. Comput., 2002)

Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem. - Irina Dumitrescu; Natashia Boland (Networks, 2003)

Preprocessing and cutting for multiple allocation hub location problems. - Natashia Boland; Mohan Krishnamoorthy; Andreas T. Ernst; Jamie Ebery (Eur. J. Oper. Res., 2004)

Minimizing beam-on time in cancer radiation treatment using multileaf collimators. - Natashia Boland; Horst W. Hamacher; Frank Lenzen (Networks, 2004)

Distance domination and amplifier placement problems. - Stephen Taylor; Ian M. Wanless; Natashia L. Boland (Australas. J Comb., 2006)

Exact procedures for solving the discrete ordered median problem. - Natashia Boland; Patricia Domínguez-Marín; Stefan Nickel; Justo Puerto (Comput. Oper. Res., 2006)

Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs. - Vicky Mak; Natashia Boland (Discret. Optim., 2006)

Accelerated label setting algorithms for the elementary resource constrained shortest path problem. - Natashia Boland; John Dethridge; Irina Dumitrescu (Oper. Res. Lett., 2006)

Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches. - Davaatseren Baatar; Natashia Boland; Sebastian Brand; Peter J. Stuckey (CPAIOR, 2007)

Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs. - Vicky Mak; Natashia Boland (Discret. Appl. Math., 2007)

Path inequalities for the vehicle routing problem with time windows. - Brian Kallehauge; Natashia Boland; Oli B. G. Madsen (Networks, 2007)

New integer linear programming approaches for course timetabling. - Natashia Boland; Barry D. Hughes; Liam T. G. Merlot; Peter J. Stuckey (Comput. Oper. Res., 2008)

LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity. - Natashia Boland; Irina Dumitrescu; Gary Froyland; Ambros M. Gleixner (Comput. Oper. Res., 2009)

Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators. - Giulia M. G. H. Wake; Natashia Boland; Les S. Jennings (Comput. Oper. Res., 2009)

A New Sequential Extraction Heuristic for Optimizing the Delivery of Cancer Radiation Treatment Using Multileaf Collimators. - Davaatseren Baatar; Natashia Boland; Robert Johnston; Horst W. Hamacher (INFORMS J. Comput., 2009)

Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem. - Ranga Muhandiramge; Natashia Boland (Networks, 2009)

Convergent Network Approximation for the Continuous Euclidean Length Constrained Minimum Cost Path Problem. - Ranga Muhandiramge; Natashia Boland; Song Wang 004 (SIAM J. Optim., 2009)

A strengthened formulation and cutting planes for the open pit mine production scheduling problem. - Andreas Bley; Natashia Boland; Christopher Fricke; Gary Froyland (Comput. Oper. Res., 2010)

Multi-objective Optimisation of Power Restoration in Electricity Distribution Systems. - Alexandre Mendes; Natashia Boland (Australasian Conference on Artificial Intelligence, 2011)

CP and IP approaches to cancer radiotherapy delivery optimization. - Davaatseren Baatar; Natashia Boland; Sebastian Brand; Peter J. Stuckey (Constraints An Int. J., 2011)

Solving shortest path problems with a weight constraint and replenishment arcs. - Olivia J. Smith; Natashia Boland; Hamish Waterer (Comput. Oper. Res., 2012)

A stockyard planning problem. - Natashia Boland; Damon Gulczynski; Martin W. P. Savelsbergh (EURO J. Transp. Logist., 2012)

Clique-based facets for the precedence constrained knapsack problem. - Natashia Boland; Andreas Bley; Christopher Fricke; Gary Froyland; Renata Sotirov (Math. Program., 2012)

A New Approach to the Feasibility Pump in Mixed Integer Programming. - Natashia L. Boland; Andrew C. Eberhard; Faramroze G. Engineer; Angelos Tsoukalas (SIAM J. Optim., 2012)

Airline planning benchmark problems - Part I: : Characterising networks and demand using limited data. - Kerem Akartunali; Natashia Boland; Ian Evans; Mark Wallace 001; Hamish Waterer (Comput. Oper. Res., 2013)

Airline planning benchmark problems - Part II: Passenger groups, utility and demand allocation. - Kerem Akartunali; Natashia Boland; Ian Evans; Mark Wallace 001; Hamish Waterer (Comput. Oper. Res., 2013)

Transport scheduling: Meeting the challenges of scale, complexity and uncertainty. - Mark Wallace 001; Natashia Boland; Edmund K. Burke (Comput. Oper. Res., 2013)

Scheduling unit processing time arc shutdown jobs to maximize network flow over time: complexity results. - Natashia Boland; Thomas Kalinowski; Reena Kapoor; Simranjit Kaur (CoRR, 2013)

Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain. - Natashia Boland; Thomas Kalinowski; Hamish Waterer; Lanbo Zheng (J. Sched., 2013)

Local Search for a Cargo Assembly Planning Problem. - Gleb Belov; Natashia Boland; Martin W. P. Savelsbergh; Peter J. Stuckey (CPAIOR, 2014)

The Triangle Splitting Method for Biobjective Mixed Integer Programming. - Natashia Boland; Hadi Charkhgard; Martin W. P. Savelsbergh (IPCO, 2014)

Scheduling arc maintenance jobs in a network to maximize total flow over time. - Natashia Boland; Thomas Kalinowski; Hamish Waterer; Lanbo Zheng (Discret. Appl. Math., 2014)

Pricing to accelerate demand learning in dynamic assortment planning for perishable products. - Masoud Talebian; Natashia Boland; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2014)

Boosting the feasibility pump. - Natashia L. Boland; Andrew C. Eberhard; Faramroze G. Engineer; Matteo Fischetti; Martin W. P. Savelsbergh; Angelos Tsoukalas (Math. Program. Comput., 2014)

Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results. - Natashia Boland; Reena Kapoor; Simranjit Kaur; Thomas Kalinowski (Networks, 2014)

Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies. - Natashia Boland; Thomas Kalinowski; Simranjit Kaur (Comput. Oper. Res., 2015)

A decision support tool for generating shipping data for the Hunter Valley coal chain. - Natashia Boland; Martin W. P. Savelsbergh; Hamish Waterer (Comput. Oper. Res., 2015)

A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method. - Natashia Boland; Hadi Charkhgard; Martin W. P. Savelsbergh (INFORMS J. Comput., 2015)

A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method. - Natashia Boland; Hadi Charkhgard; Martin W. P. Savelsbergh (INFORMS J. Comput., 2015)

A Trust Region Method for the Solution of the Surrogate Dual in Integer Programming. - Natashia Boland; Andrew C. Eberhard; Angelos Tsoukalas (J. Optim. Theory Appl., 2015)

On the augmented Lagrangian dual for integer programming. - Natashia L. Boland; Andrew C. Eberhard (Math. Program., 2015)

Optimization tools for environmental water decisions: A review of strengths, weaknesses, and opportunities to improve adoption. - Avril C. Horne; Joanna M. Szemis; Simranjit Kaur; James Angus Webb; Michael J. Stewardson; Alysson M. Costa; Natashia Boland (Environ. Model. Softw., 2016)

Proximity Benders: a decomposition heuristic for stochastic programs. - Natashia Boland; Matteo Fischetti; Michele Monaci; Martin W. P. Savelsbergh (J. Heuristics, 2016)

A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems. - Natashia Boland; Riley Clement; Hamish Waterer (INFORMS J. Comput., 2016)

Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period. - Natashia Boland; Thomas Kalinowski; Simranjit Kaur (J. Comb. Optim., 2016)

New multi-commodity flow formulations for the pooling problem. - Natashia Boland; Thomas Kalinowski; Fabian Rigterink (J. Glob. Optim., 2016)

Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming. - Natashia Boland; Irina Dumitrescu; Gary Froyland; Thomas Kalinowski (Math. Program., 2016)

The L-shape search method for triobjective integer programming. - Natashia Boland; Hadi Charkhgard; Martin W. P. Savelsbergh (Math. Program. Comput., 2016)

Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks. - Natashia Boland; Mike Hewitt; Duc Minh Vu; Martin W. P. Savelsbergh (CPAIOR, 2017)

Using optimization to develop a "designer" environmental flow regime. - Avril C. Horne; Simranjit Kaur; Joanna M. Szemis; Alysson M. Costa; James Angus Webb; Rory Nathan; Michael J. Stewardson; Lisa L. Lowe; Natashia Boland (Environ. Model. Softw., 2017)

The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs. - Natashia Boland; Hadi Charkhgard; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2017)

A new method for optimizing a linear function over the efficient set of a multiobjective integer program. - Natashia Boland; Hadi Charkhgard; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2017)

A Matheuristic for the Multivehicle Inventory Routing Problem. - Claudia Archetti; Natashia Boland; M. Grazia Speranza (INFORMS J. Comput., 2017)

The Continuous-Time Service Network Design Problem. - Natashia Boland; Mike Hewitt; Luke Marshall; Martin W. P. Savelsbergh (Oper. Res., 2017)

A polynomially solvable case of the pooling problem. - Natashia Boland; Thomas Kalinowski; Fabian Rigterink (J. Glob. Optim., 2017)

Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions. - Natashia Boland; Santanu S. Dey; Thomas Kalinowski; Marco Molinaro 001; Fabian Rigterink (Math. Program., 2017)

Integrated Aircraft Routing, Crew Pairing, and Tail Assignment: Branch-and-Price with Many Pricing Problems. - Sebastian Ruther; Natashia Boland; Faramroze G. Engineer; Ian Evans (Transp. Sci., 2017)

Dealing with Demand Uncertainty in Service Network and Load Plan Design. - Ahmad Baubaid; Natashia Boland; Martin W. P. Savelsbergh (CPAIOR, 2018)

A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem. - Edward He 001; Natashia Boland; George L. Nemhauser; Martin W. P. Savelsbergh (CPAIOR, 2018)

Maximising Throughput in a Complex Coal Export System. - Mateus Rocha de Paula; Natashia Boland; Andreas T. Ernst; Alexandre Mendes; Martin W. P. Savelsbergh (CoRR, 2018)

Combining Progressive Hedging with a Frank-Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming. - Natashia Boland; Jeffrey Christiansen; Brian C. Dandurand; Andrew C. Eberhard; Jeff T. Linderoth; James R. Luedtke; Fabricio Oliveira (SIAM J. Optim., 2018)

Throughput optimisation in a coal export system with multiple terminals and shared resources. - Mateus Rocha de Paula; Natashia Boland; Andreas T. Ernst; Alexandre Mendes; Martin W. P. Savelsbergh (Comput. Ind. Eng., 2019)

The price of discretizing time: a study in service network design. - Natashia Boland; Mike Hewitt; Luke Marshall; Martin W. P. Savelsbergh (EURO J. Transp. Logist., 2019)

Preprocessing and cut generation techniques for multi-objective binary programming. - Natashia Boland; Hadi Charkhgard; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2019)

A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems. - Natashia Boland; Jeffrey Christiansen; Brian C. Dandurand; Andrew C. Eberhard; Fabricio Oliveira (Math. Program., 2019)

Logistics optimization for a coal supply chain. - Gleb Belov; Natashia L. Boland; Martin W. P. Savelsbergh; Peter J. Stuckey (J. Heuristics, 2020)

Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs. - Ilke Bakir; Natashia Boland; Brian C. Dandurand; Alan L. Erera (INFORMS J. Comput., 2020)

A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method. - Tyler A. Perini; Natashia Boland; Diego Pecin; Martin W. P. Savelsbergh (INFORMS J. Comput., 2020)

The Continuous-Time Inventory-Routing Problem. - Felipe Lagos; Natashia Boland; Martin W. P. Savelsbergh (Transp. Sci., 2020)

Dynamic Discretization Discovery for Solving the Time-Dependent Traveling Salesman Problem with Time Windows. - Duc Minh Vu; Mike Hewitt; Natashia Boland; Martin W. P. Savelsbergh (Transp. Sci., 2020)

Corrigendum to "A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems, " INFORMS Journal on Computing 28(1): 14-30, 2016. - Natashia Boland; Riley Clement; Hamish Waterer (INFORMS J. Comput., 2021)

Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting. - Edward He 001; Natashia Boland; George L. Nemhauser; Martin W. P. Savelsbergh (INFORMS J. Comput., 2021)

Multivariable Branching: A 0-1 Knapsack Problem Case Study. - Yu Yang 014; Natashia Boland; Martin W. P. Savelsbergh (INFORMS J. Comput., 2021)

The Value of Limited Flexibility in Service Network Designs. - Ahmad Baubaid; Natashia Boland; Martin W. P. Savelsbergh (Transp. Sci., 2021)

Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem. - Luke Marshall; Natashia Boland; Martin W. P. Savelsbergh; Mike Hewitt (Transp. Sci., 2021)

Dynamic discretization discovery for solving the Continuous Time Inventory Routing Problem with Out-and-Back Routes. - Felipe Lagos; Natashia Boland; Martin W. P. Savelsbergh (Comput. Oper. Res., 2022)

Near real-time loadplan adjustments for less-than-truckload carriers. - Ian Herszterg; Yassine Ridouane; Natashia Boland; Alan L. Erera; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2022)

Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems. - Yu Yang 014; Natashia Boland; Bistra Dilkina; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2022)

Substitution-based equipment balancing in service networks with multiple equipment types. - Yu Yang 014; Yassine Ridouane; Natashia Boland; Alan L. Erera; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2022)

Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems. - Edward Yuhang He; Natashia Boland; George L. Nemhauser; Martin W. P. Savelsbergh (INFORMS J. Comput., 2022)

Decomposition Branching for Mixed Integer Programming. - Baris Yildiz 001; Natashia Boland; Martin W. P. Savelsbergh (Oper. Res., 2022)

Decomposition of loosely coupled integer programs: a multiobjective perspective. - Merve Bodur; Shabbir Ahmed 001; Natashia Boland; George L. Nemhauser (Math. Program., 2022)

Multicriteria Course Mode Selection and Classroom Assignment Under Sudden Space Scarcity. - Mehran Navabi-Shirazi; Mohamed El Tonbari; Natashia Boland; Dima Nazzal; Lauren N. Steimle (Manuf. Serv. Oper. Manag., 2022)

An exact algorithm for the service network design problem with hub capacity constraints. - Edward He 001; Natashia Boland; George L. Nemhauser; Martin W. P. Savelsbergh (Networks, 2022)

The Dynamic Freight Routing Problem for Less-Than-Truckload Carriers. - Ahmad Baubaid; Natashia Boland; Martin W. P. Savelsbergh (Transp. Sci., 2023)

Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems. - Stephan Helfrich; Tyler A. Perini; Pascal Halffmann; Natashia Boland; Stefan Ruzika (J. Glob. Optim., 2023)

On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem. - Samira Fallah; Ted K. Ralphs; Natashia L. Boland (Math. Methods Oper. Res., 2024)

A fast and robust algorithm for solving biobjective mixed integer programs. - Diego Pecin; Ian Herszterg; Tyler A. Perini; Natashia Boland; Martin W. P. Savelsbergh (Math. Methods Oper. Res., 2024)