World's Best Scientists 2026 revealed!

D-Index & Metrics

Mathematics

D-Index
36
Citations
5493
World Ranking
2642
National Ranking
1088

Engineering and Technology

D-Index
37
Citations
5633
World Ranking
8382
National Ranking
2322

Overview

Natashia Boland is affiliated with the Georgia Institute of Technology in the United States and has contributed extensively to the fields of engineering and computer science. Their research primarily focuses on industrial and manufacturing engineering, computer networks and communications, control and systems engineering, computational theory and mathematics, and transportation.

The scientist's work encompasses several key topics, including:

  • Vehicle Routing Optimization Methods
  • Optimization and Packing Problems
  • Scheduling and Optimization Algorithms
  • Optimization and Search Problems
  • Transportation Planning and Optimization
  • Advanced Multi-Objective Optimization Algorithms
  • Process Optimization and Integration

Natashia Boland has published frequently in notable venues such as:

  • Transportation Science
  • INFORMS Journal on Computing
  • European Journal of Operational Research
  • Mathematical Methods of Operations Research
  • Journal of Heuristics

Recent publications include:

  • "Logistics optimization for a coal supply chain," 2020, Journal of Heuristics
  • "Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem," 2020, Transportation Science
  • "The Continuous-Time Inventory-Routing Problem," 2020, Transportation Science
  • "Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems," 2021, INFORMS Journal on Computing
  • "The Value of Limited Flexibility in Service Network Designs," 2020, Transportation Science

The scientist has worked collaboratively with several researchers, including:

  • Martin Savelsbergh
  • George L. Nemhauser
  • Edward He
  • Yu Yang
  • Felipe Lagos

Natashia Boland's research contributions span across both theoretical and practical dimensions of optimization and operations research. Their work includes methods for vehicle routing, service network design, and supply chain logistics, addressing complex problems such as continuous-time routing and inventory management.

Best Publications

  • Flight String Models for Aircraft Fleeting and Routing

    Cynthia Barnhart;Natashia L. Boland;Lloyd W. Clarke;Ellis L. Johnson

  • The capacitated multiple allocation hub location problem: Formulations and algorithms

    Jamie Ebery;Jamie Ebery;Mohan Krishnamoorthy;Andreas Tilman Ernst;Natashia Lesley Boland

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

    Irina Dumitrescu;Natashia Boland

  • A Hybrid Algorithm for the Examination Timetabling Problem

    Liam T. G. Merlot;Natashia Boland;Barry D. Hughes;Peter J. Stuckey

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

    Natashia Boland;John Dethridge;Irina Dumitrescu

  • 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

  • Preprocessing and cutting for multiple allocation hub location problems

    Natashia Lesley Boland;Mohan Krishnamoorthy;Andreas Tilman Ernst;Jamie Ebery

  • The Continuous-Time Service Network Design Problem.

    Natashia Boland;Mike Hewitt;Luke Marshall;Martin W. P. Savelsbergh

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

    Andreas Bley;Natashia Boland;Christopher Fricke;Gary Froyland

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

    Natashia Boland;Horst W. Hamacher;Frank Lenzen

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

    Natashia Boland;Hadi Charkhgard;Martin W. P. Savelsbergh

  • Algorithms for the Weight Constrained Shortest Path Problem

    Irina Dumitrescu;Natashia Boland

  • Solving shortest path problems with a weight constraint and replenishment arcs

    Olivia J. Smith;Natashia Boland;Hamish Waterer

  • Exact procedures for solving the discrete ordered median problem

    Natashia Boland;Patricia Domínguez-Marín;Stefan Nickel;Justo Puerto

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

    James D. Foster;Adam M. Berry;Natashia Boland;Hamish Waterer

  • The L-shape search method for triobjective integer programming

    Natashia Boland;Hadi Charkhgard;Martin W. P. Savelsbergh

  • New integer linear programming approaches for course timetabling

    Natashia Boland;Barry D. Hughes;Liam T. G. Merlot;Peter J. Stuckey

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

    Natashia Boland;Hadi Charkhgard;Martin W. P. Savelsbergh

  • Switch and Tap-Changer Reconfiguration of Distribution Networks Using Evolutionary Algorithms

    A. Mendes;N. Boland;P. Guiney;C. Riveros

  • 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

  • A Matheuristic for the Multivehicle Inventory Routing Problem

    Claudia Archetti;Natashia Boland;M. Grazia Speranza

Frequent Co-Authors

Martin W. P. Savelsbergh
Martin W. P. Savelsbergh Georgia Institute of Technology
Andreas T. Ernst
Andreas T. Ernst Monash University
Peter J. Stuckey
Peter J. Stuckey Monash University
Gary Froyland
Gary Froyland University of New South Wales
George L. Nemhauser
George L. Nemhauser Georgia Institute of Technology
Ellis L. Johnson
Ellis L. Johnson Georgia Institute of Technology
Rodney S. Tucker
Rodney S. Tucker University of Melbourne
Horst W. Hamacher
Horst W. Hamacher Technical University of Kaiserslautern
Mohan Krishnamoorthy
Mohan Krishnamoorthy University of Queensland

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students pursuing Mathematics in the USA, diversifying their skills through related online degrees can boost career prospects. Many professionals consider advancing into business fields by exploring transfer credits for online mba programs to leverage previous coursework for faster completion.

Additionally, evolving data-driven industries offer excellent opportunities with specialized degrees such as analytics masters programs. These programs focus on developing expertise in data interpretation and statistical analysis, key skills for mathematicians expanding into data science roles.

For those seeking easier entry or a quicker route to business leadership, options like mba programs easy to get into and easiest and fastest online mba programs provide flexible alternatives. These programs accommodate busy schedules and can complement a strong mathematical foundation with practical business knowledge.

Overall, combining Mathematics with targeted online degrees can open diverse career pathways, from data analytics to business management, allowing students to tailor their education to changing job market demands.

Best Scientists Citing Natashia Boland

Trending Scientists

Recently Published Articles