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

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

1 2 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. Pióro, Michał; Fouquet, Yoann; Nace, Dritan; Poss, Michael: Optimizing flow thinning protection in multicommodity networks with variable link capacity (2016)
  4. Bärmann, Andreas; Liers, Frauke; Martin, Alexander; Merkert, Maximilian; Thurner, Christoph; Weninger, Dieter: Solving network design problems via iterative aggregation (2015)
  5. Pessoa, Artur Alves; Poss, Michael: Robust network design with uncertain outsourcing cost (2015)
  6. Agarwal, Y.K.; Venkateshan, Prahalad: Survivable network design with shared-protection routing (2014)
  7. Ben-Ameur, W.; Pióro, M.; Żotkiewicz, M.: Fractional routing using pairs of failure-disjoint paths (2014)
  8. Grötschel, Martin; Raack, Christian; Werner, Axel: Towards optimizing the deployment of optical access networks (2014)
  9. Poss, Michael: A comparison of routing sets for robust network design (2014)
  10. Babonneau, F.; Vial, J.-P.; Klopfenstein, O.; Ouorou, A.: Robust capacity assignment solutions for telecommunications networks with uncertain demands (2013)
  11. Houbraken, Maarten; Demeyer, Sofie; Staessens, Dimitri; Audenaert, Pieter; Colle, Didier; Pickavet, Mario: Fault tolerant network design inspired by \itPhysarum polycephalum (2013)
  12. Mattia, Sara: The robust network loading problem with dynamic routing (2013)
  13. Poss, Michael; Raack, Christian: Affine recourse for the robust network design problem: between static and dynamic routing (2013)
  14. Mattia, Sara: Solving survivable two-layer network design problems by metric inequalities (2012)
  15. Mattia, Sara: Separating tight metric inequalities by bilevel programming (2012)
  16. Thapalia, Biju K.; Crainic, Teodor Gabriel; Kaut, Michal; Wallace, Stein W.: Single-commodity network design with random edge capacities (2012)
  17. Thapalia, Biju K.; Wallace, Stein W.; Kaut, Michal; Crainic, Teodor Gabriel: Single source single-commodity stochastic network design (2012)
  18. Ben-Ameur, Walid; Żotkiewicz, Mateusz: Robust routing and optimal partitioning of a traffic demand polytope (2011)
  19. Bley, Andreas: An integer programming algorithm for routing optimization in IP networks (2011)
  20. Carroll, Paula; Fortz, Bernard; Labbé, Martine; McGarraghy, Seán: Improved formulations for the ring spur assignment problem (2011)

1 2 next