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

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

1 2 3 4 5 next

  1. Álvarez-Miranda, Eduardo; Sinnl, Markus: A branch-and-cut algorithm for the maximum covering cycle problem (2020)
  2. Álvarez-Miranda, Eduardo; Sinnl, Markus: Mixed-integer programming approaches for the tree (t^*)-spanner problem (2019)
  3. Mahjoub, A. Ridha; Poss, Michael; Simonetti, Luidi; Uchoa, Eduardo: Distance transformation for network design problems (2019)
  4. Rehfeldt, Daniel; Koch, Thorsten: Combining NP-hard reduction techniques and strong heuristics in an exact algorithm for the maximum-weight connected subgraph problem (2019)
  5. Shinano, Yuji; Rehfeldt, Daniel; Koch, Thorsten: Building optimal Steiner trees on supercomputers by using up to 43,000 cores (2019)
  6. Di Puglia Pugliese, Luigi; Gaudioso, Manlio; Guerriero, Francesca; Miglionico, Giovanna: A Lagrangean-based decomposition approach for the link constrained Steiner tree problem (2018)
  7. Leitner, Markus; Ljubić, Ivana; Luipersbeck, Martin; Sinnl, Markus: Decomposition methods for the two-stage stochastic Steiner tree problem (2018)
  8. Pajor, Thomas; Uchoa, Eduardo; Werneck, Renato F.: A robust and scalable algorithm for the Steiner problem in graphs (2018)
  9. Shinano, Yuji: The ubiquity generator framework: 7 years of progress in parallelizing branch-and-bound (2018)
  10. Á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)
  11. Álvarez-Miranda, Eduardo; Ljubić, Ivana; Luipersbeck, Martin; Sinnl, Markus: Solving minimum-cost shared arborescence problems (2017)
  12. Álvarez-Miranda, Eduardo; Pereira, Jordi: Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach (2017)
  13. Álvarez-Miranda, Eduardo; Sinnl, Markus: Lagrangian and branch-and-cut approaches for upgrading spanning tree problems (2017)
  14. 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)
  15. Gamrath, Gerald; Koch, Thorsten; Maher, Stephen J.; Rehfeldt, Daniel; Shinano, Yuji: SCIP-Jack -- a solver for STP and variants with parallelization extensions (2017)
  16. Hougardy, Stefan; Silvanus, Jannik; Vygen, Jens: Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm (2017)
  17. Leitner, Markus; Ljubić, Ivana; Salazar-González, Juan-José; Sinnl, Markus: An algorithmic framework for the exact solution of tree-star problems (2017)
  18. Bicalho, Luis Henrique; da Cunha, Alexandre Salles; Lucena, Abilio: Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (2016)
  19. Bui, Quoc Trung; Deville, Yves; Pham, Quang Dung: Exact methods for solving the elementary shortest and longest path problems (2016)
  20. Chimani, Markus; Klein, Karsten; Wiedera, Tilo: A note on the practicality of maximal planar subgraph algorithms (2016)

1 2 3 4 5 next