Natashia Boland
16 catalog papers. Identity-linked publications and additional name matches are distinguished below.
ORCID: 0000-0002-6867-6125
Publications
- Erratum to “Multicriteria Course Mode Selection and Classroom Assignment Under Sudden Space Scarcity” — Manufacturing & Service Operations Management 2026 (name-matched, not ORCID-linked)
- Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems — INFORMS Journal on Computing 2022
- Multicriteria Course Mode Selection and Classroom Assignment Under Sudden Space Scarcity — Manufacturing & Service Operations Management 2022
- Decomposition Branching for Mixed Integer Programming — Operations Research 2022
- Multivariable Branching: A 0-1 Knapsack Problem Case Study — INFORMS Journal on Computing 2021
- Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting — INFORMS Journal on Computing 2021
- Corrigendum to “A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems,”INFORMS Journal on Computing28(1):14–30, 2016 — INFORMS Journal on Computing 2021
- Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs — INFORMS Journal on Computing 2020
- A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method — INFORMS Journal on Computing 2020
- The Continuous-Time Service Network Design Problem — Operations Research 2017
- A Matheuristic for the Multivehicle Inventory Routing Problem — INFORMS Journal on Computing 2017
- A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems — INFORMS Journal on Computing 2016
- A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method — INFORMS Journal on Computing 2015
- A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method — INFORMS Journal on Computing 2015
- A New Sequential Extraction Heuristic for Optimizing the Delivery of Cancer Radiation Treatment Using Multileaf Collimators — INFORMS Journal on Computing 2009
- Efficient Intelligent Backtracking Using Linear Programming — INFORMS Journal on Computing 2002