SNDlib

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 46 articles )

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

1 2 3 next

  1. Cacchiani, Valentina; Jünger, Michael; Liers, Frauke; Lodi, Andrea; Schmidt, Daniel R.: Single-commodity robust network design with finite and hose demand sets (2016)
  2. Hill, Alessandro; Voß, Stefan: Optimal capacitated ring trees (2016)
  3. Papadimitriou, Dimitri; Fortz, Bernard: Distributed monitoring problem (2016)
  4. Pióro, Michał; Fouquet, Yoann; Nace, Dritan; Poss, Michael: Optimizing flow thinning protection in multicommodity networks with variable link capacity (2016)
  5. Rodríguez-Martín, Inmaculada; Salazar-González, Juan-José; Yaman, Hande: Hierarchical survivable network design problems (2016)
  6. Taccari, Leonardo: Integer programming formulations for the elementary shortest path problem (2016)
  7. Bärmann, Andreas; Liers, Frauke; Martin, Alexander; Merkert, Maximilian; Thurner, Christoph; Weninger, Dieter: Solving network design problems via iterative aggregation (2015)
  8. Botton, Quentin; Fortz, Bernard; Gouveia, Luis: On the hop-constrained survivable network design problem with reliable edges (2015)
  9. Coudert, David; Kodjo, Alvinice; Phan, Truong Khoa: Robust energy-aware routing with redundancy elimination (2015)
  10. Pessoa, Artur Alves; Poss, Michael: Robust network design with uncertain outsourcing cost (2015)
  11. Agarwal, Y.K.; Venkateshan, Prahalad: Survivable network design with shared-protection routing (2014)
  12. Ben-Ameur, W.; Pióro, M.; Żotkiewicz, M.: Fractional routing using pairs of failure-disjoint paths (2014)
  13. Claßen, Grit; Koster, Arie M.C.A.; Coudert, David; Nepomuceno, Napoleão: Chance-constrained optimization of reliable fixed broadband wireless networks (2014)
  14. Fischetti, Matteo; Monaci, Michele: Proximity search for 0--1 mixed-integer convex programming (2014)
  15. Grötschel, Martin; Raack, Christian; Werner, Axel: Towards optimizing the deployment of optical access networks (2014)
  16. Poss, Michael: A comparison of routing sets for robust network design (2014)
  17. Babonneau, F.; Vial, J.-P.; Klopfenstein, O.; Ouorou, A.: Robust capacity assignment solutions for telecommunications networks with uncertain demands (2013)
  18. Carroll, Paula; McGarraghy, Seán: A decomposition algorithm for the ring spur assignment problem (2013)
  19. Houbraken, Maarten; Demeyer, Sofie; Staessens, Dimitri; Audenaert, Pieter; Colle, Didier; Pickavet, Mario: Fault tolerant network design inspired by \itPhysarum polycephalum (2013) ioport
  20. Koster, Arie M.C.A.; Kutschka, Manuel; Raack, Christian: Robust network design: formulations, valid inequalities, and computations (2013)

1 2 3 next