default search action
Natashia Boland
Natashia L. Boland
Person information
- affiliation: Georgia Institute of Technology, Atlanta, GA, USA
- affiliation (former): University of Melbourne, Department of Mathematics and Statistics, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j85]Samira Fallah, Ted K. Ralphs, Natashia L. Boland:
On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem. Math. Methods Oper. Res. 100(1): 175-220 (2024) - [j84]Diego Pecin, Ian Herszterg, Tyler A. Perini
, Natashia Boland, Martin W. P. Savelsbergh:
A fast and robust algorithm for solving biobjective mixed integer programs. Math. Methods Oper. Res. 100(1): 221-262 (2024) - 2023
- [j83]Stephan Helfrich
Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems. J. Glob. Optim. 86(2): 417-440 (2023) - [j82]Ahmad Baubaid
The Dynamic Freight Routing Problem for Less-Than-Truckload Carriers. Transp. Sci. 57(3): 717-740 (2023) - 2022
- [j81]Felipe Lagos
Dynamic discretization discovery for solving the Continuous Time Inventory Routing Problem with Out-and-Back Routes. Comput. Oper. Res. 141: 105686 (2022) - [j80]Yu Yang
Substitution-based equipment balancing in service networks with multiple equipment types. Eur. J. Oper. Res. 300(3): 966-978 (2022) - [j79]Yu Yang
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems. Eur. J. Oper. Res. 301(3): 828-840 (2022) - [j78]Ian Herszterg
Near real-time loadplan adjustments for less-than-truckload carriers. Eur. J. Oper. Res. 301(3): 1021-1034 (2022) - [j77]Edward Yuhang He
Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems. INFORMS J. Comput. 34(2): 1086-1114 (2022) - [j76]Baris Yildiz
Decomposition Branching for Mixed Integer Programming. Oper. Res. 70(3): 1854-1872 (2022) - [j75]Merve Bodur
Decomposition of loosely coupled integer programs: a multiobjective perspective. Math. Program. 196(1): 427-477 (2022) - [j74]Mehran Navabi-Shirazi
Multicriteria Course Mode Selection and Classroom Assignment Under Sudden Space Scarcity. Manuf. Serv. Oper. Manag. 24(6): 3252-3268 (2022) - [j73]Edward He
An exact algorithm for the service network design problem with hub capacity constraints. Networks 80(4): 572-596 (2022) - 2021
- [j72]Natashia Boland, Riley Clement, Hamish Waterer
Corrigendum to "A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems, " INFORMS Journal on Computing 28(1): 14-30, 2016. INFORMS J. Comput. 33(2): 835 (2021) - [j71]Edward He
Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting. INFORMS J. Comput. 33(3): 997-1014 (2021) - [j70]Yu Yang
Multivariable Branching: A 0-1 Knapsack Problem Case Study. INFORMS J. Comput. 33(4): 1354-1367 (2021) - [j69]Luke Marshall
Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem. Transp. Sci. 55(1): 29-51 (2021) - [j68]Ahmad Baubaid
The Value of Limited Flexibility in Service Network Designs. Transp. Sci. 55(1): 52-74 (2021) - 2020
- [j67]Gleb Belov
Logistics optimization for a coal supply chain. J. Heuristics 26(2): 269-300 (2020) - [j66]Tyler A. Perini
A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method. INFORMS J. Comput. 32(1): 16-39 (2020) - [j65]Ilke Bakir
Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs. INFORMS J. Comput. 32(1): 145-163 (2020) - [j64]Felipe Lagos
The Continuous-Time Inventory-Routing Problem. Transp. Sci. 54(2): 375-399 (2020) - [j63]Duc Minh Vu
Dynamic Discretization Discovery for Solving the Time-Dependent Traveling Salesman Problem with Time Windows. Transp. Sci. 54(3): 703-720 (2020)
2010 – 2019
- 2019
- [j62]Mateus Rocha de Paula, Natashia Boland, Andreas T. Ernst, Alexandre Mendes
Throughput optimisation in a coal export system with multiple terminals and shared resources. Comput. Ind. Eng. 134: 37-51 (2019) - [j61]Natashia Boland, Mike Hewitt, Luke Marshall
The price of discretizing time: a study in service network design. EURO J. Transp. Logist. 8(2): 195-216 (2019) - [j60]Natashia Boland
Preprocessing and cut generation techniques for multi-objective binary programming. Eur. J. Oper. Res. 274(3): 858-875 (2019) - [j59]Natashia Boland
A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems. Math. Program. 175(1-2): 503-536 (2019) - 2018
- [j58]Natashia Boland
Combining Progressive Hedging with a Frank-Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming. SIAM J. Optim. 28(2): 1312-1336 (2018) - [c8]Ahmad Baubaid
Dealing with Demand Uncertainty in Service Network and Load Plan Design. CPAIOR 2018: 63-71 - [c7]Edward He, Natashia Boland
A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem. CPAIOR 2018: 289-297 - [i4]Mateus Rocha de Paula, Natashia Boland, Andreas T. Ernst, Alexandre Mendes, Martin W. P. Savelsbergh:
Maximising Throughput in a Complex Coal Export System. CoRR abs/1808.06044 (2018) - 2017
- [j57]Avril C. Horne
Using optimization to develop a "designer" environmental flow regime. Environ. Model. Softw. 88: 188-199 (2017) - [j56]Natashia Boland
The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs. Eur. J. Oper. Res. 260(3): 873-885 (2017) - [j55]Natashia Boland
A new method for optimizing a linear function over the efficient set of a multiobjective integer program. Eur. J. Oper. Res. 260(3): 904-919 (2017) - [j54]Claudia Archetti
A Matheuristic for the Multivehicle Inventory Routing Problem. INFORMS J. Comput. 29(3): 377-387 (2017) - [j53]Natashia Boland
The Continuous-Time Service Network Design Problem. Oper. Res. 65(5): 1303-1321 (2017) - [j52]Natashia Boland
A polynomially solvable case of the pooling problem. J. Glob. Optim. 67(3): 621-630 (2017) - [j51]Natashia Boland
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions. Math. Program. 162(1-2): 523-535 (2017) - [j50]Sebastian Ruther, Natashia Boland
Integrated Aircraft Routing, Crew Pairing, and Tail Assignment: Branch-and-Price with Many Pricing Problems. Transp. Sci. 51(1): 177-195 (2017) - [c6]Natashia Boland
Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks. CPAIOR 2017: 254-262 - 2016
- [j49]Avril C. Horne
Optimization tools for environmental water decisions: A review of strengths, weaknesses, and opportunities to improve adoption. Environ. Model. Softw. 84: 326-338 (2016) - [j48]Natashia Boland
Proximity Benders: a decomposition heuristic for stochastic programs. J. Heuristics 22(2): 181-198 (2016) - [j47]Natashia Boland
A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems. INFORMS J. Comput. 28(1): 14-30 (2016) - [j46]Natashia Boland
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period. J. Comb. Optim. 32(3): 885-905 (2016) - [j45]Natashia Boland
New multi-commodity flow formulations for the pooling problem. J. Glob. Optim. 66(4): 669-710 (2016) - [j44]Natashia Boland
Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming. Math. Program. 157(1): 69-93 (2016) - [j43]Natashia Boland
The L-shape search method for triobjective integer programming. Math. Program. Comput. 8(2): 217-251 (2016) - 2015
- [j42]Natashia Boland
A decision support tool for generating shipping data for the Hunter Valley coal chain. Comput. Oper. Res. 53: 54-67 (2015) - [j41]Natashia Boland
Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies. Comput. Oper. Res. 64: 113-129 (2015) - [j40]Natashia Boland
A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method. INFORMS J. Comput. 27(4): 597-618 (2015) - [j39]Natashia Boland
A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method. INFORMS J. Comput. 27(4): 735-754 (2015) - [j38]Natashia Boland
A Trust Region Method for the Solution of the Surrogate Dual in Integer Programming. J. Optim. Theory Appl. 167(2): 558-584 (2015) - [j37]Natashia L. Boland
On the augmented Lagrangian dual for integer programming. Math. Program. 150(2): 491-509 (2015) - [i3]Natashia Boland, Thomas Kalinowski, Fabian Rigterink:
A polynomially solvable case of the pooling problem. CoRR abs/1508.03181 (2015) - 2014
- [j36]Natashia Boland
Scheduling arc maintenance jobs in a network to maximize total flow over time. Discret. Appl. Math. 163: 34-52 (2014) - [j35]Masoud Talebian, Natashia Boland
Pricing to accelerate demand learning in dynamic assortment planning for perishable products. Eur. J. Oper. Res. 237(2): 555-565 (2014) - [j34]Natashia L. Boland
Boosting the feasibility pump. Math. Program. Comput. 6(3): 255-279 (2014) - [j33]Natashia Boland
Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results. Networks 63(2): 196-202 (2014) - [c5]Gleb Belov
Local Search for a Cargo Assembly Planning Problem. CPAIOR 2014: 159-175 - [c4]Natashia Boland
The Triangle Splitting Method for Biobjective Mixed Integer Programming. IPCO 2014: 162-173 - 2013
- [j32]Mark Wallace
Transport scheduling: Meeting the challenges of scale, complexity and uncertainty. Comput. Oper. Res. 40(3): 655-656 (2013) - [j31]Kerem Akartunali
Airline planning benchmark problems - Part I: : Characterising networks and demand using limited data. Comput. Oper. Res. 40(3): 775-792 (2013) - [j30]Kerem Akartunali
Airline planning benchmark problems - Part II: Passenger groups, utility and demand allocation. Comput. Oper. Res. 40(3): 793-804 (2013) - [j29]Natashia Boland
Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain. J. Sched. 16(6): 649-659 (2013) - [i2]Natashia Boland, Thomas Kalinowski, Reena Kapoor, Simranjit Kaur:
Scheduling unit processing time arc shutdown jobs to maximize network flow over time: complexity results. CoRR abs/1306.4917 (2013) - [i1]Natashia Boland, Thomas Kalinowski, Simranjit Kaur:
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period. CoRR abs/1307.3650 (2013) - 2012
- [j28]Olivia J. Smith
Solving shortest path problems with a weight constraint and replenishment arcs. Comput. Oper. Res. 39(5): 964-984 (2012) - [j27]Natashia Boland, Damon Gulczynski, Martin W. P. Savelsbergh:
A stockyard planning problem. EURO J. Transp. Logist. 1(3): 197-236 (2012) - [j26]Natashia Boland
Clique-based facets for the precedence constrained knapsack problem. Math. Program. 133(1-2): 481-511 (2012) - [j25]Natashia L. Boland
A New Approach to the Feasibility Pump in Mixed Integer Programming. SIAM J. Optim. 22(3): 831-861 (2012) - 2011
- [j24]Davaatseren Baatar
CP and IP approaches to cancer radiotherapy delivery optimization. Constraints An Int. J. 16(2): 173-194 (2011) - [c3]Alexandre Mendes
Multi-objective Optimisation of Power Restoration in Electricity Distribution Systems. Australasian Conference on Artificial Intelligence 2011: 779-788 - 2010
- [j23]Andreas Bley
A strengthened formulation and cutting planes for the open pit mine production scheduling problem. Comput. Oper. Res. 37(9): 1641-1647 (2010)
2000 – 2009
- 2009
- [j22]Giulia M. G. H. Wake, Natashia Boland
Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators. Comput. Oper. Res. 36(3): 795-810 (2009) - [j21]Natashia Boland
LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity. Comput. Oper. Res. 36(4): 1064-1089 (2009) - [j20]Davaatseren Baatar
A New Sequential Extraction Heuristic for Optimizing the Delivery of Cancer Radiation Treatment Using Multileaf Collimators. INFORMS J. Comput. 21(2): 224-241 (2009) - [j19]Ranga Muhandiramge, Natashia Boland
Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem. Networks 53(4): 358-381 (2009) - [j18]Ranga Muhandiramge, Natashia Boland
Convergent Network Approximation for the Continuous Euclidean Length Constrained Minimum Cost Path Problem. SIAM J. Optim. 20(1): 54-77 (2009) - 2008
- [j17]Natashia Boland
New integer linear programming approaches for course timetabling. Comput. Oper. Res. 35(7): 2209-2233 (2008) - 2007
- [j16]Vicky Mak
Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs. Discret. Appl. Math. 155(16): 2093-2110 (2007) - [j15]Brian Kallehauge, Natashia Boland
Path inequalities for the vehicle routing problem with time windows. Networks 49(4): 273-293 (2007) - [c2]Davaatseren Baatar, Natashia Boland, Sebastian Brand, Peter J. Stuckey:
Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches. CPAIOR 2007: 1-15 - 2006
- [j14]Stephen Taylor, Ian M. Wanless, Natashia L. Boland:
Distance domination and amplifier placement problems. Australas. J Comb. 34: 117-136 (2006) - [j13]Natashia Boland
Exact procedures for solving the discrete ordered median problem. Comput. Oper. Res. 33(11): 3270-3300 (2006) - [j12]Vicky Mak
Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs. Discret. Optim. 3(1): 33-49 (2006) - [j11]Natashia Boland
Accelerated label setting algorithms for the elementary resource constrained shortest path problem. Oper. Res. Lett. 34(1): 58-68 (2006) - 2004
- [j10]Natashia Boland
Preprocessing and cutting for multiple allocation hub location problems. Eur. J. Oper. Res. 155(3): 638-653 (2004) - [j9]Natashia Boland
Minimizing beam-on time in cancer radiation treatment using multileaf collimators. Networks 43(4): 226-240 (2004) - 2003
- [j8]Irina Dumitrescu, Natashia Boland
Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem. Networks 42(3): 135-153 (2003) - 2002
- [j7]Bruce Davey, Natashia Boland
Efficient Intelligent Backtracking Using Linear Programming. INFORMS J. Comput. 14(4): 373-386 (2002) - [c1]Liam T. G. Merlot, Natashia Boland, Barry D. Hughes, Peter J. Stuckey:
A Hybrid Algorithm for the Examination Timetabling Problem. PATAT 2002: 207-231 - 2001
- [j6]Natashia Boland
A Column Generation Approach to Delivery Planning over Time with Inhomogeneous Service Providers and Service Interval Constraints. Ann. Oper. Res. 108(1-4): 143-156 (2001) - 2000
- [j5]Jamie Ebery, Mohan Krishnamoorthy
The capacitated multiple allocation hub location problem: Formulations and algorithms. Eur. J. Oper. Res. 120(3): 614-631 (2000) - [j4]Natashia L. Boland
The asymmetric traveling salesman problem with replenishment arcs. Eur. J. Oper. Res. 123(2): 408-427 (2000) - [j3]Philip J. Neame, Natashia Boland
An outer approximate subdifferential method for piecewise affine optimization. Math. Program. 87(1): 57-86 (2000)
1990 – 1999
- 1998
- [j2]Cynthia Barnhart
Flight String Models for Aircraft Fleeting and Routing. Transp. Sci. 32(3): 208-220 (1998) - 1997
- [j1]Natashia L. Boland:
A dual-active-set algorithm for positive semi-definite quadratic programming. Math. Program. 77: 1-27 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: