References in zbMATH (referenced in 81 articles , 1 standard article )

Showing results 1 to 20 of 81.
Sorted by year (citations)

1 2 3 4 5 next

  1. Di Puglia Pugliese, Luigi; Gaudioso, Manlio; Guerriero, Francesca; Miglionico, Giovanna: A Lagrangean-based decomposition approach for the link constrained Steiner tree problem (2018)
  2. Leitner, Markus; Ljubić, Ivana; Luipersbeck, Martin; Sinnl, Markus: Decomposition methods for the two-stage stochastic Steiner tree problem (2018)
  3. Pajor, Thomas; Uchoa, Eduardo; Werneck, Renato F.: A robust and scalable algorithm for the Steiner problem in graphs (2018)
  4. Álvarez-Miranda, Eduardo; Farhan, Hesso; Luipersbeck, Martin; Sinnl, Markus: A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death (2017)
  5. Álvarez-Miranda, Eduardo; Ljubić, Ivana; Luipersbeck, Martin; Sinnl, Markus: Solving minimum-cost shared arborescence problems (2017)
  6. Fischetti, Matteo; Leitner, Markus; Ljubić, Ivana; Luipersbeck, Martin; Monaci, Michele; Resch, Max; Salvagnin, Domenico; Sinnl, Markus: Thinning out Steiner trees: a node-based model for uniform edge costs (2017)
  7. Leitner, Markus; Ljubić, Ivana; Salazar-González, Juan-José; Sinnl, Markus: An algorithmic framework for the exact solution of tree-star problems (2017)
  8. Bicalho, Luis Henrique; da Cunha, Alexandre Salles; Lucena, Abilio: Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (2016)
  9. Bui, Quoc Trung; Deville, Yves; Pham, Quang Dung: Exact methods for solving the elementary shortest and longest path problems (2016)
  10. Chimani, Markus; Klein, Karsten; Wiedera, Tilo: A note on the practicality of maximal planar subgraph algorithms (2016)
  11. Hill, Alessandro; Voß, Stefan: Optimal capacitated ring trees (2016)
  12. Leitner, Markus: Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem (2016)
  13. Leitner, Markus; Ljubić, Ivana; Sinnl, Markus; Werner, Axel: ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (2016)
  14. van Loggerenberg, S. P.; Ferreira, M.; Grobler, M. J.; Terblanche, S. E.: Benders decomposition of the passive optical network design problem (2016)
  15. Watel, Dimitri; Weisser, Marc-Antoine: A practical greedy approximation for the directed Steiner tree problem (2016)
  16. Watel, Dimitri; Weisser, Marc-Antoine; Bentz, Cédric; Barth, Dominique: Directed Steiner trees with diffusion costs (2016)
  17. Beyer, Stephan; Chimani, Markus: The influence of preprocessing on Steiner tree approximations (2015)
  18. Delling, Daniel; Fleischman, Daniel; Goldberg, Andrew V.; Razenshteyn, Ilya; Werneck, Renato F.: An exact combinatorial algorithm for minimum graph bisection (2015)
  19. Fafianie, Stefan; Bodlaender, Hans; Nederlof, Jesper: Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions (2015)
  20. Smith-Miles, Kate; Bowly, Simon: Generating new test instances by evolving in instance space (2015)

1 2 3 4 5 next