( en | de | ru )

 

Disambiguation of "Boland, Natashia"

Author of the publication

copydeleteadd this publication to your clipboard
Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain.

, , , and . J. Sched., 16 (6): 649-659 (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Wilhelm Boland

David Boland

Gerda Boland

Wilhelm Boland

Tobias Boland

 

Other publications of authors with the same name

A Column Generation Approach to Delivery Planning over Time with Inhomogeneous Service Providers and Service Interval Constraints., and . Ann. Oper. Res., 108 (1-4): 143-156 (2001)Accelerated label setting algorithms for the elementary resource constrained shortest path problem., , and . Oper. Res. Lett., 34 (1): 58-68 (2006)Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem., and . Networks, 42 (3): 135-153 (2003)Maximising Throughput in a Complex Coal Export System., , , , and . CoRR, (2018)A polynomially solvable case of the pooling problem., , and . CoRR, (2015)Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming., , , and . Math. Program., 157 (1): 69-93 (2016)Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period., , and . J. Comb. Optim., 32 (3): 885-905 (2016)The Triangle Splitting Method for Biobjective Mixed Integer Programming., , and . IPCO, volume 8494 of Lecture Notes in Computer Science, page 162-173. Springer, (2014)Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs., and . Discret. Appl. Math., 155 (16): 2093-2110 (2007)Decomposition of loosely coupled integer programs: a multiobjective perspective., , , and . Math. Program., 196 (1): 427-477 (2022)