Natashia Boland

88 papers B 6C 1Journal 80Unranked 1

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