Natashia Boland

发表

Improving order picking efficiency through better warehouse design

Natashia Boland, E. J. E. Duane, Heng-Soon Gan, 2005 .

Local Search for a Cargo Assembly Planning Problem

Peter J. Stuckey, Martin W. P. Savelsbergh, Natashia Boland, 2014, CPAIOR.

Clique-based facets for the precedence constrained knapsack problem

Natashia Boland, Andreas Bley, Christopher Fricke, 2012, Math. Program..

Solving mixed integer nonlinear programming problems for mine production planning with stockpiling

Natashia Boland, Andreas Bley, Gary Froyland, 2012 .

Convergent Network Approximation for the Continuous Euclidean Length Constrained Minimum Cost Path Problem

Natashia Boland, Song Wang, Ranga Muhandiramge, 2009, SIAM J. Optim..

Logistics optimization for a coal supply chain

Peter J. Stuckey, Martin W. P. Savelsbergh, Natashia Boland, 2020, J. Heuristics.

Corrigendum to “A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems,” INFORMS Journal on Computing 28(1):14–30, 2016

Natashia Boland, Hamish Waterer, Riley Clement, 2020 .

A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method

Martin W. P. Savelsbergh, Natashia Boland, Hadi Charkhgard, 2015, INFORMS J. Comput..

The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs

Martin W. P. Savelsbergh, Natashia Boland, Hadi Charkhgard, 2017, Eur. J. Oper. Res..

A dual-active-set algorithm for positive semi-definite quadratic programming

Natashia Boland, N. Boland, 1997, Math. Program..

Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches

Peter J. Stuckey, Natashia Boland, Davaatseren Baatar, 2007, CPAIOR.

The L-shape search method for triobjective integer programming

Martin W. P. Savelsbergh, Natashia Boland, Hadi Charkhgard, 2016, Math. Program. Comput..

Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators

Natashia Boland, Les S. Jennings, Giulia M. G. H. Wake, 2009, Comput. Oper. Res..

The price of discretizing time: a study in service network design

Martin W. P. Savelsbergh, Natashia Boland, Mike Hewitt, 2019, EURO J. Transp. Logist..

Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem

Natashia Boland, Ranga Muhandiramge, N. Boland, 2009, Networks.

Scheduling arc maintenance jobs in a network to maximize total flow over time

Natashia Boland, Lanbo Zheng, Thomas Kalinowski, 2014, Discret. Appl. Math..

A new method for optimizing a linear function over the efficient set of a multiobjective integer program

Martin W. P. Savelsbergh, Natashia Boland, Hadi Charkhgard, 2017, Eur. J. Oper. Res..

Precedence constrained knapsack problem data instances

Natashia Boland, Andreas Bley, Christopher Fricke, 2010 .

A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems

Natashia Boland, Hamish Waterer, Riley Clement, 2016, INFORMS J. Comput..

Airline planning benchmark problems - Part II: Passenger groups, utility and demand allocation

Mark Wallace, Natashia Boland, Kerem Akartunali, 2013, Comput. Oper. Res..

On the behaviour of robots through singularities

Natashia Boland, Robyn Owens, 1988 .

Rejoinder on: Perspectives on integer programming for time-dependent models

Martin W. P. Savelsbergh, Natashia Boland, 2019 .

LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity

Ambros M. Gleixner, Natashia Boland, Gary Froyland, 2009, Comput. Oper. Res..

Maximising Throughput in a Complex Coal Export System pdf

Andreas T. Ernst, Martin W. P. Savelsbergh, Natashia Boland, 2018, ArXiv.

A Trust Region Method for the Solution of the Surrogate Dual in Integer Programming

Andrew C. Eberhard, Natashia Boland, Angelos Tsoukalas, 2015, J. Optim. Theory Appl..

Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs

Vicky H. Mak-Hau, Natashia Boland, 2006, Discret. Optim..

Efficient Intelligent Backtracking Using Linear Programming

Peter J. Stuckey, Natashia Boland, Bruce Davey, 2002, INFORMS J. Comput..

Accelerated label setting algorithms for the elementary resource constrained shortest path problem

Natashia Boland, Irina Dumitrescu, John Dethridge, 2006, Oper. Res. Lett..

An Algorithm for Non-Linear Network Programming: Implementation, Results and Comparisons

Natashia Boland, C. J. Goh, A. I. Mees, 1992 .

Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period

Natashia Boland, Simranjit Kaur, Thomas Kalinowski, 2013, J. Comb. Optim..

A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem

Martin W. P. Savelsbergh, George L. Nemhauser, Natashia Boland, 2018, CPAIOR.

A Column Generation Approach to Delivery Planning over Time with Inhomogeneous Service Providers and Service Interval Constraints

Natashia Boland, Timothy J. Surendonk, 2001, Ann. Oper. Res..

Finding an Optimal Stationing Policy for the US Army in Europe After the Force Drawdown

George L. Nemhauser, Ellis L. Johnson, Natashia Boland, 1996 .

The asymmetric traveling salesman problem with replenishment arcs

George L. Nemhauser, Natashia Boland, Lloyd W. Clarke, 2000, Eur. J. Oper. Res..

Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies

Natashia Boland, Simranjit Kaur, Thomas Kalinowski, 2014, Comput. Oper. Res..

Preprocessing and cutting for multiple allocation hub location problems

Andreas T. Ernst, Natashia Boland, Mohan Krishnamoorthy, 2004, Eur. J. Oper. Res..

A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method

Martin W. P. Savelsbergh, Natashia Boland, Diego Pecin, 2020, INFORMS J. Comput..

Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain

Natashia Boland, Lanbo Zheng, Thomas Kalinowski, 2013, J. Sched..

Data generation in the Hunter Valley Coal Chain: a case study in capacity assessment

Martin W. P. Savelsbergh, Natashia Boland, Hamish Waterer, 2011 .

Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems

Natashia Boland, Edward He, Martin Savelsbergh, 2021, INFORMS J. Comput..

Solving shortest path problems with a weight constraint and replenishment arcs

Natashia Boland, Olivia J. Smith, Hamish Waterer, 2012, Comput. Oper. Res..

A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method

Martin W. P. Savelsbergh, Natashia Boland, Hadi Charkhgard, 2015, INFORMS J. Comput..

Combining Progressive Hedging with a Frank-Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming

Andrew C. Eberhard, James R. Luedtke, Natashia Boland, 2017, SIAM J. Optim..

Biobjective mixed integer programs instances

Martin W. P. Savelsbergh, Natashia Boland, Hadi Charkhgard, 2013 .

Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions

Marco Molinaro, Natashia Boland, Thomas Kalinowski, 2015, Math. Program..

Pricing to Accelerate Demand Learning in Dynamic Assortment Planning for Perishable Products

Martin W. P. Savelsbergh, Natashia Boland, Masoud Talebian, 2013, Eur. J. Oper. Res..

On the augmented Lagrangian dual for integer programming

Andrew C. Eberhard, Natashia Boland, Andrew Craig Eberhard, 2015, Math. Program..

A Hybrid Algorithm for the Examination Timetabling Problem

Peter J. Stuckey, Natashia Boland, Barry D. Hughes, 2002, PATAT.

Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs

Vicky H. Mak-Hau, Natashia Boland, 2007, Discret. Appl. Math..

Exact procedures for solving the discrete ordered median problem

Justo Puerto, Stefan Nickel, Natashia Boland, 2006, Comput. Oper. Res..

Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem

Natashia Boland, Mike Hewitt, Martin W. P. Savelsbergh, 2020 .

Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting

George L. Nemhauser, Natashia Boland, Edward He, 2020, INFORMS J. Comput..

Integrated Aircraft Routing, Crew Pairing, and Tail Assignment: Branch-and-Price with Many Pricing Problems

Natashia Boland, Ian Evans, Faramroze G. Engineer, 2017, Transp. Sci..

Solving environmental problems with integer programming: recent experience and challenges | NOVA. The University of Newcastle's Digital Repository

Natashia Boland, 2009 .

Optimization tools for environmental water decisions: A review of strengths, weaknesses, and opportunities to improve adoption

Alysson M. Costa, Michael J. Stewardson, Natashia Boland, 2016, Environ. Model. Softw..

Flight String Models for Aircraft Fleeting and Routing

George L. Nemhauser, Cynthia Barnhart, Ellis L. Johnson, 1998, Transp. Sci..

Transport scheduling: Meeting the challenges of scale, complexity and uncertainty

Edmund K. Burke, Mark Wallace, Natashia Boland, 2013, Comput. Oper. Res..

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"

Martin W. P. Savelsbergh, Natashia Boland, Hadi Charkhgard, 2015 .

Time aggregation for network design to meet time-constrained demand

Andreas T. Ernst, Martin W. P. Savelsbergh, Gaurav Singh, 2013 .

Comparison of Mixed-Integer Programming and Genetic Algorithm Methods for Distributed Generation Planning

Natashia Boland, Hamish Waterer, James D. Foster, 2014, IEEE Transactions on Power Systems.

(N-1) contingency planning in radial distribution networks using genetic algorithms

Natashia Boland, Patrick Guiney, Carlos Riveros, 2010, 2010 IEEE/PES Transmission and Distribution Conference and Exposition: Latin America (T&D-LA).

A New Sequential Extraction Heuristic for Optimizing the Delivery of Cancer Radiation Treatment Using Multileaf Collimators

Horst W. Hamacher, Robert Johnston, Natashia Boland, 2009, INFORMS J. Comput..

A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems

Andrew C. Eberhard, Natashia Boland, Brian Dandurand, 2017, Mathematical Programming.

Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks

Martin W. P. Savelsbergh, Natashia Boland, Mike Hewitt, 2017, CPAIOR.

The Value of Limited Flexibility in Service Network Designs

Martin W. P. Savelsbergh, Natashia Boland, Ahmad Baubaid, 2020, Transp. Sci..

An algorithm for solving quadratic network flow problems | NOVA. The University of Newcastle's Digital Repository

Natashia Boland, C. J. Goh, A. I. Mees, 1991 .

New integer linear programming approaches for course timetabling

Peter J. Stuckey, Natashia Boland, Barry D. Hughes, 2008, Comput. Oper. Res..

Dynamic Discretization Discovery for Solving the Time-Dependent Traveling Salesman Problem with Time Windows

Martin W. P. Savelsbergh, Natashia Boland, Duc Minh Vu, 2020, Transp. Sci..

A Matheuristic for the Multivehicle Inventory Routing Problem

Maria Grazia Speranza, Natashia Boland, Claudia Archetti, 2017, INFORMS J. Comput..

Improved stockyard management strategies for coal export terminal at Newcastle

Martin W. P. Savelsbergh, Natashia Boland, D. Gulezynski, 2011 .

Distance domination and amplifier placement problems

Stephen Taylor, Ian M. Wanless, Natashia Boland, 2006, Australas. J Comb..

Throughput optimisation in a coal export system with multiple terminals and shared resources

Andreas T. Ernst, Martin W. P. Savelsbergh, Natashia Boland, 2019, Comput. Ind. Eng..

A decision support tool for generating shipping data for the Hunter Valley coal chain

Martin W. P. Savelsbergh, Natashia Boland, Hamish Waterer, 2015, Comput. Oper. Res..

Scheduling unit processing time arc shutdown jobs to maximize network flow over time: complexity results pdf

Natashia Boland, Simranjit Kaur, Thomas Kalinowski, 2012, ArXiv.

A mathematical programming based decision support tool for force allocation

Natashia Boland, Heng-Soon Gan, R. Egudo, 2005 .

Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results

Natashia Boland, Simranjit Kaur, Thomas Kalinowski, 2013, Networks.

A branch-and-bound algorithm for scheduling unit processing time arc shutdown jobs to maximize flow through a transshipment node over time

Natashia Boland, Simranjit Kaur, 2013 .

New multi-commodity flow formulations for the pooling problem

Natashia Boland, Thomas Kalinowski, Fabian Rigterink, 2016, J. Glob. Optim..

A stockyard planning problem

Martin W. P. Savelsbergh, Natashia Boland, Damon Gulczynski, 2012, EURO J. Transp. Logist..

Perspectives on integer programming for time-dependent models

Martin W. P. Savelsbergh, Natashia Boland, M. Savelsbergh, 2019, TOP.

The capacitated multiple allocation hub location problem: Formulations and algorithms

Andreas T. Ernst, Natashia Boland, Mohan Krishnamoorthy, 2000, Eur. J. Oper. Res..

The Continuous-Time Inventory-Routing Problem

Natashia Boland, Felipe Lagos, Martin Savelsbergh, 2020, Transp. Sci..

The Triangle Splitting Method for Biobjective Mixed Integer Programming

Martin W. P. Savelsbergh, Natashia Boland, Hadi Charkhgard, 2014, IPCO.

CP and IP approaches to cancer radiotherapy delivery optimization

Peter J. Stuckey, Natashia Boland, Davaatseren Baatar, 2011, Constraints.

Efficient design of WDM ring networks with optical amplifiers

Natashia Boland, Rodney S. Tucker, An V. Tran, 2001 .

Multi-objective Optimisation of Power Restoration in Electricity Distribution Systems

Natashia Boland, Alexandre Mendes, 2011, Australasian Conference on Artificial Intelligence.

Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs

Natashia Boland, Brian Dandurand, Alan L. Erera, 2020, INFORMS J. Comput..

The Continuous-Time Service Network Design Problem

Martin W. P. Savelsbergh, Natashia Boland, Mike Hewitt, 2017, Oper. Res..

Minimizing beam‐on time in cancer radiation treatment using multileaf collimators

Horst W. Hamacher, Natashia Boland, Frank Lenzen, 2004, Networks.

A polynomially solvable case of the pooling problem

Natashia Boland, Thomas Kalinowski, Fabian Rigterink, 2017, J. Glob. Optim..

Proximity Benders: a decomposition heuristic for stochastic programs

Matteo Fischetti, Martin W. P. Savelsbergh, Michele Monaci, 2016, J. Heuristics.

New methods for multi-commodity flows

Natashia Boland, A. I. Mees, A. Mees, 1990 .

Optimal 2-commodity flows with nonlinear cost functions

Andreas T. Ernst, Natashia Boland, C. J. Goh, 1995 .

Boosting the feasibility pump

Matteo Fischetti, Martin W. P. Savelsbergh, Andrew C. Eberhard, 2014, Mathematical Programming Computation.

Airline planning benchmark problems - Part I: : Characterising networks and demand using limited data

Mark Wallace, Natashia Boland, Kerem Akartunali, 2013, Comput. Oper. Res..

A New Approach to the Feasibility Pump in Mixed Integer Programming

Andrew C. Eberhard, Natashia Boland, Faramroze G. Engineer, 2012, SIAM J. Optim..

Improved preprocessing, labeling and scaling algorithms for the Weight‐Constrained Shortest Path Problem

Natashia Boland, Irina Dumitrescu, I. Dumitrescu, 2003, Networks.

An optimisation approach to maintenance scheduling for capacity alignment in the Hunter Valley coal chain

Natashia Boland, Lanbo Zheng, Hamish Waterer, 2011 .

Dealing with Demand Uncertainty in Service Network and Load Plan Design

Martin W. P. Savelsbergh, Natashia Boland, Ahmad Baubaid, 2018, CPAIOR.

Using optimization to develop a "designer" environmental flow regime

Alysson M. Costa, Michael J. Stewardson, Natashia Boland, 2017, Environ. Model. Softw..

Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming

Natashia Boland, Gary Froyland, Thomas Kalinowski, 2016, Mathematical Programming.

Preprocessing and cut generation techniques for multi-objective binary programming

Martin W. P. Savelsbergh, Natashia Boland, Hadi Charkhgard, 2019, Eur. J. Oper. Res..

An outer approximate subdifferential method for piecewise affine optimization

Daniel Ralph, Natashia Boland, Philip J. Neame, 2000, Math. Program..

Path inequalities for the vehicle routing problem with time windows

Natashia Boland, Brian Kallehauge, Oli B. G. Madsen, 2007, Networks.

A strengthened formulation and cutting planes for the open pit mine production scheduling problem

Natashia Boland, Andreas Bley, Christopher Fricke, 2010, Comput. Oper. Res..

Multivariable Branching: A 0-1 Knapsack Problem Case Study

Martin W. P. Savelsbergh, Natashia Boland, Yu Yang, 2021, INFORMS J. Comput..

Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems

Natashia Boland, Bistra Dilkina, Martin Savelsbergh, 2022, Eur. J. Oper. Res..

A Simple and Efficient Algorithm For Solving Three Objective Integer Programs

Natashia Boland, Hadi Charkhgard, Martin Savelsbergh, 2014 .

A Faster Version of the ASG Algorithm

Andreas T. Ernst, Natashia Boland, C. J. Goh, 1994 .

Computational Complexity of Time-Dependent Shortest Path Problems

Natashia Boland, Edward He, George Nemhauser, 2019 .

Optimizing the Hunter Valley Coal Chain

Martin W. P. Savelsbergh, Natashia Boland, M. Savelsbergh, 2012 .

Shipping Data Generation for the Hunter Valley Coal Chain ∗

Natashia Boland, Hamish Waterer, Martin Savelsbergh, 2013 .

Optimizing wind farm siting to reduce power system impacts of wind variability

Natashia Boland, Dima Nazzal, Valerie M. Thomas, 2019, Wind Energy.