From post

A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes.

, , и . INOC, том 6701 из Lecture Notes in Computer Science, стр. 57-70. Springer, (2011)

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.

 

Другие публикации лиц с тем же именем

Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates., , и . CoRR, (2022)Exact approaches to the single-source network loading problem., , и . Networks, 59 (1): 89-106 (2012)An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem., и . EvoWorkshops, том 2037 из Lecture Notes in Computer Science, стр. 20-29. Springer, (2001)A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems., , , и . INFORMS J. Comput., 30 (2): 402-420 (2018)Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem., и . INFORMS J. Comput., 25 (2): 256-270 (2013)Variable Neighborhood Search for Solving the Balanced Location Problem., , и . Electron. Notes Discret. Math., (2012)On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes., , и . ISCO, том 7422 из Lecture Notes in Computer Science, стр. 201-212. Springer, (2012)A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs., , , и . Hybrid Metaheuristics, том 8457 из Lecture Notes in Computer Science, стр. 56-70. Springer, (2014)The Two Level Network Design Problem with Secondary Hop Constraints., , и . INOC, том 6701 из Lecture Notes in Computer Science, стр. 71-76. Springer, (2011)Benders decomposition for the discrete ordered median problem., , , и . Eur. J. Oper. Res., 317 (3): 858-874 (2024)