( en | de | ru )

 

Disambiguation of "Boland, Natashia"

Author of the publication

copydeleteadd this publication to your clipboard
Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks.

, , , and . CPAIOR, volume 10335 of Lecture Notes in Computer Science, page 254-262. Springer, (2017)

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 polynomially solvable case of the pooling problem., , and . CoRR, (2015)The Triangle Splitting Method for Biobjective Mixed Integer Programming., , and . IPCO, volume 8494 of Lecture Notes in Computer Science, page 162-173. Springer, (2014)Decomposition of loosely coupled integer programs: a multiobjective perspective., , , and . Math. Program., 196 (1): 427-477 (2022)Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period., , and . CoRR, (2013)New integer linear programming approaches for course timetabling., , , and . Comput. Oper. Res., 35 (7): 2209-2233 (2008)Dynamic Discretization Discovery for Solving the Time-Dependent Traveling Salesman Problem with Time Windows., , , and . Transp. Sci., 54 (3): 703-720 (2020)Multi-objective Optimisation of Power Restoration in Electricity Distribution Systems., and . Australasian Conference on Artificial Intelligence, volume 7106 of Lecture Notes in Computer Science, page 779-788. Springer, (2011)A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem., , , and . CPAIOR, volume 10848 of Lecture Notes in Computer Science, page 289-297. Springer, (2018)The capacitated multiple allocation hub location problem: Formulations and algorithms., , , and . Eur. J. Oper. Res., 120 (3): 614-631 (2000)Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks., , , and . CPAIOR, volume 10335 of Lecture Notes in Computer Science, page 254-262. Springer, (2017)