Natashia Boland

Georgia Institute of Technology — United States

Engineering · Physical Sciences

34h-index4.4kcitations139works2.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Vehicle Routing Optimization Methods(55), Optimization and Packing Problems(23), Scheduling and Optimization Algorithms(18), Transportation Planning and Optimization(17), Transportation and Mobility Innovations(14)

Publications139 total

On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem
Mathematical Methods of Operations Research·2024· 2 cited
A fast and robust algorithm for solving biobjective mixed integer programs
Mathematical Methods of Operations Research·2024· 2 cited
Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems
Journal of Global Optimization·2023· 11 citedOpen Access
On the Relationship Between the Value Function and the Efficient Frontier of a Mixed Integer Linear Optimization Problem
arXiv (Cornell University)·2023· 1 citedOpen Access
The Dynamic Freight Routing Problem for Less-Than-Truckload Carriers
Transportation Science·2022· 5 cited
An exact algorithm for the service network design problem with hub capacity constraints
Networks·2022· 5 cited
Multicriteria Course Mode Selection and Classroom Assignment Under Sudden Space Scarcity
Manufacturing & Service Operations Management·2022· 12 cited
Decomposition of loosely coupled integer programs: a multiobjective perspective
Mathematical Programming·2022· 9 cited
Decomposition Branching for Mixed Integer Programming
Operations Research·2022· 6 cited
Dynamic discretization discovery for solving the Continuous Time Inventory Routing Problem with Out-and-Back Routes
Computers & Operations Research·2022· 13 cited
Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems
INFORMS journal on computing·2021· 19 cited
Learning generalized strong branching for set covering, set packing, and 0–1 knapsack problems
European Journal of Operational Research·2021· 15 cited
Near real-time loadplan adjustments for less-than-truckload carriers
European Journal of Operational Research·2021· 7 cited
Substitution-based equipment balancing in service networks with multiple equipment types
European Journal of Operational Research·2021
Multivariable Branching: A 0-1 Knapsack Problem Case Study
INFORMS journal on computing·2021· 9 cited
Corrigendum to “A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems,” <i>INFORMS Journal on Computing</i> 28(1):14–30, 2016
INFORMS journal on computing·2020
Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting
INFORMS journal on computing·2020· 8 cited
Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem
Transportation Science·2020· 28 cited
The Value of Limited Flexibility in Service Network Designs
Transportation Science·2020· 14 cited
The Continuous-Time Inventory-Routing Problem
Transportation Science·2020· 24 cited
page 1 of 7Next →

Frequent Co-authors

Martin Savelsbergh(18), Hadi Charkhgard(5), Irina Dumitrescu(4), Peter J. Stuckey(4), Mike Hewitt(4), Hamish Waterer(4), Thomas Kalinowski(4), Andreas Ernst(3), Luke Marshall(3), Andrew Eberhard(3), Faramroze G. Engineer(3), Lloyd W. Clarke(2), George L. Nemhauser(2), Jamie Ebery(2), Mohan Krishnamoorthy(2), Liam T. G. Merlot(2), Barry D. Hughes(2), Gary Froyland(2), Alexandre Mendes(2), Avril Horne(2)