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

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

1 2 3 4 next

  1. Bicalho, Luis Henrique; da Cunha, Alexandre Salles; Lucena, Abilio: Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (2016)
  2. Hill, Alessandro; Voß, Stefan: Optimal capacitated ring trees (2016)
  3. Watel, Dimitri; Weisser, Marc-Antoine: A practical greedy approximation for the directed Steiner tree problem (2016)
  4. Watel, Dimitri; Weisser, Marc-Antoine; Bentz, Cédric; Barth, Dominique: Directed Steiner trees with diffusion costs (2016)
  5. Delling, Daniel; Fleischman, Daniel; Goldberg, Andrew V.; Razenshteyn, Ilya; Werneck, Renato F.: An exact combinatorial algorithm for minimum graph bisection (2015)
  6. 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)
  7. Smith-Miles, Kate; Bowly, Simon: Generating new test instances by evolving in instance space (2015)
  8. Amaldi, Edoardo; Coniglio, Stefano; Gualandi, Stefano: Coordinated cutting plane generation via multi-objective separation (2014)
  9. Grötschel, Martin; Raack, Christian; Werner, Axel: Towards optimizing the deployment of optical access networks (2014)
  10. Leggieri, Valeria; Haouari, Mohamed; Triki, Chefi: The Steiner tree problem with delays: a compact formulation and reduction procedures (2014)
  11. Martinez, Leonardo Conegundes; Salles da Cunha, Alexandre: The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (2014)
  12. Borndörfer, Ralf; Hoang, Nam-Dũng; Karbstein, Marika; Koch, Thorsten; Martin, Alexander: How many Steiner terminals can you connect in 20 years? (2013)
  13. Borndörfer, Ralf; Karbstein, Marika; Pfetsch, Marc E.: The Steiner connectivity problem (2013)
  14. Fafianie, Stefan; Bodlaender, Hans L.; Nederlof, Jesper: Speeding up dynamic programming with representative sets. An experimental evaluation of algorithms for Steiner Tree on tree decompositions (2013)
  15. Goerigk, Marc: Algorithms and concepts for robust optimization (2013)
  16. Liang, Zhe; Lee, Chungmok; Chaovalitwongse, W.Art: Mathematical programming approaches for dual multicast routing problem with multilayer risk cost (2013)
  17. Simonetti, Luidi; da Cunha, Alexandre Salles; Lucena, Abilio: Polyhedral results and a branch-and-cut algorithm for the $k$-cardinality tree problem (2013)
  18. Chardy, Matthieu; Costa, Marie-Christine; Faye, Alain; Trampont, M.: Optimizing splitter and fiber location in a multilevel optical FTTH network (2012)
  19. Hoàng, Nam-Dũng; Koch, Thorsten: Steiner tree packing revisited (2012)
  20. Leggieri, V.; Haouari, M.; Triki, C.: A branch-and-cut algorithm for the Steiner tree problem with delays (2012)

1 2 3 4 next