Natashia Boland
Orcid: 0000-0002-6867-6125Affiliations:
- Georgia Institute of Technology, Atlanta, GA, USA
- University of Melbourne, Department of Mathematics and Statistics, Australia (former)
According to our database1,
Natashia Boland
authored at least 93 papers
between 1997 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on scopus.com
-
on orcid.org
On csauthors.net:
Bibliography
2023
Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems.
J. Glob. Optim., June, 2023
Transp. Sci., May, 2023
2022
An exact algorithm for the service network design problem with hub capacity constraints.
Networks, 2022
Multicriteria Course Mode Selection and Classroom Assignment Under Sudden Space Scarcity.
Manuf. Serv. Oper. Manag., 2022
Math. Program., 2022
Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems.
INFORMS J. Comput., 2022
Substitution-based equipment balancing in service networks with multiple equipment types.
Eur. J. Oper. Res., 2022
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems.
Eur. J. Oper. Res., 2022
Eur. J. Oper. Res., 2022
Dynamic discretization discovery for solving the Continuous Time Inventory Routing Problem with Out-and-Back Routes.
Comput. Oper. Res., 2022
2021
Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem.
Transp. Sci., 2021
INFORMS J. Comput., 2021
Corrigendum to "A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems, " <i>INFORMS Journal on Computing</i> 28(1): 14-30, 2016.
INFORMS J. Comput., 2021
2020
Dynamic Discretization Discovery for Solving the Time-Dependent Traveling Salesman Problem with Time Windows.
Transp. Sci., 2020
A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method.
INFORMS J. Comput., 2020
INFORMS J. Comput., 2020
2019
A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems.
Math. Program., 2019
Eur. J. Oper. Res., 2019
EURO J. Transp. Logist., 2019
Throughput optimisation in a coal export system with multiple terminals and shared resources.
Comput. Ind. Eng., 2019
2018
Combining Progressive Hedging with a Frank-Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming.
SIAM J. Optim., 2018
A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018
2017
Integrated Aircraft Routing, Crew Pairing, and Tail Assignment: Branch-and-Price with Many Pricing Problems.
Transp. Sci., 2017
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions.
Math. Program., 2017
INFORMS J. Comput., 2017
A new method for optimizing a linear function over the efficient set of a multiobjective integer program.
Eur. J. Oper. Res., 2017
The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs.
Eur. J. Oper. Res., 2017
Environ. Model. Softw., 2017
Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017
2016
Math. Program. Comput., 2016
Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming.
Math. Program., 2016
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period.
J. Comb. Optim., 2016
INFORMS J. Comput., 2016
J. Heuristics, 2016
Optimization tools for environmental water decisions: A review of strengths, weaknesses, and opportunities to improve adoption.
Environ. Model. Softw., 2016
2015
J. Optim. Theory Appl., 2015
A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method.
INFORMS J. Comput., 2015
A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method.
INFORMS J. Comput., 2015
A decision support tool for generating shipping data for the Hunter Valley coal chain.
Comput. Oper. Res., 2015
Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies.
Comput. Oper. Res., 2015
2014
Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results.
Networks, 2014
Pricing to accelerate demand learning in dynamic assortment planning for perishable products.
Eur. J. Oper. Res., 2014
Discret. Appl. Math., 2014
Proceedings of the Integer Programming and Combinatorial Optimization, 2014
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014
2013
Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain.
J. Sched., 2013
Scheduling unit processing time arc shutdown jobs to maximize network flow over time: complexity results.
CoRR, 2013
Comput. Oper. Res., 2013
Airline planning benchmark problems - Part II: Passenger groups, utility and demand allocation.
Comput. Oper. Res., 2013
Airline planning benchmark problems - Part I: : Characterising networks and demand using limited data.
Comput. Oper. Res., 2013
2012
SIAM J. Optim., 2012
Math. Program., 2012
Comput. Oper. Res., 2012
2011
Constraints An Int. J., 2011
Multi-objective Optimisation of Power Restoration in Electricity Distribution Systems.
Proceedings of the AI 2011: Advances in Artificial Intelligence, 2011
2010
A strengthened formulation and cutting planes for the open pit mine production scheduling problem.
Comput. Oper. Res., 2010
2009
Convergent Network Approximation for the Continuous Euclidean Length Constrained Minimum Cost Path Problem.
SIAM J. Optim., 2009
Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem.
Networks, 2009
A New Sequential Extraction Heuristic for Optimizing the Delivery of Cancer Radiation Treatment Using Multileaf Collimators.
INFORMS J. Comput., 2009
Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators.
Comput. Oper. Res., 2009
LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity.
Comput. Oper. Res., 2009
2008
Comput. Oper. Res., 2008
2007
Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs.
Discret. Appl. Math., 2007
Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2007
2006
Accelerated label setting algorithms for the elementary resource constrained shortest path problem.
Oper. Res. Lett., 2006
Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs.
Discret. Optim., 2006
Comput. Oper. Res., 2006
2004
Networks, 2004
Eur. J. Oper. Res., 2004
2003
Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem.
Networks, 2003
2002
INFORMS J. Comput., 2002
Proceedings of the Practice and Theory of Automated Timetabling IV, 2002
2001
A Column Generation Approach to Delivery Planning over Time with Inhomogeneous Service Providers and Service Interval Constraints.
Ann. Oper. Res., 2001
2000
Math. Program., 2000
The capacitated multiple allocation hub location problem: Formulations and algorithms.
Eur. J. Oper. Res., 2000
Eur. J. Oper. Res., 2000
1998
1997
Math. Program., 1997