SNDlib is a library of test instances for Survivable fixed telecommunication Network Design. Its purpose is to make realistic network design test instances available to the research community, to serve as a standardized benchmark for testing, evaluating, and comparing network design models and algorithms, to be a source of information and resources related to fixed network design, and to provide a contact platform for researchers and practitioners working in this field. To this end, the library includes a set of network design instances together with the best known solutions and dual bounds, a list of conferences related to this area, and a mailing list.

References in zbMATH (referenced in 59 articles )

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

1 2 3 next

  1. Wang, Guanglei; Ben-Ameur, Walid; Ouorou, Adam: A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines (2019)
  2. Agarwal, Y. K.: Network loading problem: valid inequalities from 5- and higher partitions (2018)
  3. Lei, Xiao; Shen, Siqian; Song, Yongjia: Stochastic maximum flow interdiction problems under heterogeneous risk preferences (2018)
  4. Lodi, Andrea; Moradi, Ahmad: Experiments on virtual private network design with concave capacity costs (2018)
  5. Mattia, Sara; Poss, Michael: A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation (2018)
  6. Pióro, Michał; Kalesnikau, Ilya; Poss, Michael: Path generation for affine flow thinning (2018)
  7. Silva, Marco; Poss, Michael; Maculan, Nelson: (k)-adaptive routing for the robust network loading problem (2018)
  8. Fortz, Bernard; Gouveia, Luís; Joyce-Moniz, Martim: Models for the piecewise linear unsplittable multicommodity flow problems (2017)
  9. Monemi, Rahimeh Neamatian; Gelareh, Shahin: The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach (2017)
  10. Nakao, Hideaki; Shen, Siqian; Chen, Zhihao: Network design in scarce data environment using moment-based distributionally robust optimization (2017)
  11. Ayoub, Josette; Poss, Michael: Decomposition for adjustable robust linear optimization subject to uncertainty polytope (2016)
  12. Bärmann, Andreas; Heidt, Andreas; Martin, Alexander; Pokutta, Sebastian; Thurner, Christoph: Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study (2016)
  13. Cacchiani, Valentina; Jünger, Michael; Liers, Frauke; Lodi, Andrea; Schmidt, Daniel R.: Single-commodity robust network design with finite and hose demand sets (2016)
  14. Hill, Alessandro; Voß, Stefan: Optimal capacitated ring trees (2016)
  15. Papadimitriou, Dimitri; Fortz, Bernard: Distributed monitoring problem (2016)
  16. Pióro, Michał; Fouquet, Yoann; Nace, Dritan; Poss, Michael: Optimizing flow thinning protection in multicommodity networks with variable link capacity (2016)
  17. Rodríguez-Martín, Inmaculada; Salazar-González, Juan-José; Yaman, Hande: Hierarchical survivable network design problems (2016)
  18. Taccari, Leonardo: Integer programming formulations for the elementary shortest path problem (2016)
  19. Bärmann, Andreas; Liers, Frauke; Martin, Alexander; Merkert, Maximilian; Thurner, Christoph; Weninger, Dieter: Solving network design problems via iterative aggregation (2015)
  20. Botton, Quentin; Fortz, Bernard; Gouveia, Luis: On the hop-constrained survivable network design problem with reliable edges (2015)

1 2 3 next