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

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

1 2 3 4 5 6 next

  1. Álvarez-Miranda, Eduardo; Sinnl, Markus: A branch-and-cut algorithm for the maximum covering cycle problem (2020)
  2. Arslan, Okan; Jabali, Ola; Laporte, Gilbert: A flexible, natural formulation for the network design problem with vulnerability constraints (2020)
  3. Bichler, Martin; Hao, Zhen; Littmann, Richard; Waldherr, Stefan: Strategyproof auction mechanisms for network procurement (2020)
  4. Volz, Marcus; Brazil, Marcus; Ras, Charl; Thomas, Doreen: Computing skeletons for rectilinearly convex obstacles in the rectilinear plane (2020)
  5. Álvarez-Miranda, Eduardo; Sinnl, Markus: Mixed-integer programming approaches for the tree (t^*)-spanner problem (2019)
  6. Mahjoub, A. Ridha; Poss, Michael; Simonetti, Luidi; Uchoa, Eduardo: Distance transformation for network design problems (2019)
  7. Rehfeldt, Daniel; Koch, Thorsten: Combining NP-hard reduction techniques and strong heuristics in an exact algorithm for the maximum-weight connected subgraph problem (2019)
  8. Shinano, Yuji; Rehfeldt, Daniel; Koch, Thorsten: Building optimal Steiner trees on supercomputers by using up to 43,000 cores (2019)
  9. Ceselli, Alberto; Damiani, Maria Luisa; Righini, Giovanni; Valorsi, Diego: Mathematical programming algorithms for spatial cloaking (2018)
  10. Chimani, Markus; Hedtke, Ivo; Wiedera, Tilo: Exact algorithms for the maximum planar subgraph problem: new models and experiments (2018)
  11. Di Puglia Pugliese, Luigi; Gaudioso, Manlio; Guerriero, Francesca; Miglionico, Giovanna: A Lagrangean-based decomposition approach for the link constrained Steiner tree problem (2018)
  12. Leitner, Markus; Ljubić, Ivana; Luipersbeck, Martin; Sinnl, Markus: Decomposition methods for the two-stage stochastic Steiner tree problem (2018)
  13. Leitner, Markus; Ljubić, Ivana; Luipersbeck, Martin; Sinnl, Markus: A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems (2018)
  14. Pajor, Thomas; Uchoa, Eduardo; Werneck, Renato F.: A robust and scalable algorithm for the Steiner problem in graphs (2018)
  15. Shinano, Yuji: The ubiquity generator framework: 7 years of progress in parallelizing branch-and-bound (2018)
  16. Á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)
  17. Álvarez-Miranda, Eduardo; Ljubić, Ivana; Luipersbeck, Martin; Sinnl, Markus: Solving minimum-cost shared arborescence problems (2017)
  18. Álvarez-Miranda, Eduardo; Pereira, Jordi: Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach (2017)
  19. Álvarez-Miranda, Eduardo; Sinnl, Markus: Lagrangian and branch-and-cut approaches for upgrading spanning tree problems (2017)
  20. 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)

1 2 3 4 5 6 next