( en | de | ru )

 

Disambiguation of "Ljubic, Ivana"

Author of the publication

copydeleteadd this publication to your clipboard
Hop constrained Steiner trees with multiple root nodes.

, , and . Eur. J. Oper. Res., 236 (1): 100-112 (2014)

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.

Andreas Ljubic

Algis Ivanauskas

Johann Ivanauskas

Ivana Mesic

Rolle der N-terminalen Domänen (NTDs) bei der Assemblierung und Funktion von N-Methyl-D-Aspartat (NMDA)-Rezeptoren. TU Darmstadt, (2009)

Ivana Tolic

 

Other publications of authors with the same name

An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem., and . EvoWorkshops, volume 2037 of Lecture Notes in Computer Science, page 20-29. Springer, (2001)A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation.. Networks, 56 (3): 169-182 (2010)Exact approaches to the single-source network loading problem., , and . Networks, 59 (1): 89-106 (2012)Variable Neighborhood Search for Solving the Balanced Location Problem., , and . Electron. Notes Discret. Math., (2012)MIP models for connected facility location: A theoretical and computational study., and . Comput. Oper. Res., 38 (2): 435-449 (2011)Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem., and . INFORMS J. Comput., 25 (2): 256-270 (2013)A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems., , , and . INFORMS J. Comput., 30 (2): 402-420 (2018)Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates., , and . CoRR, (2022)An Exact Method for Fortification Games., , , , and . CoRR, (2021)An algorithmic framework for the exact solution of tree-star problems., , , and . Eur. J. Oper. Res., 261 (1): 54-66 (2017)