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

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

1 2 3 4 next

  1. Bin Obaid, Hamoud S.; Trafalis, Theodore B.: An approximation to max min fairness in multi commodity networks (2020)
  2. Bouras, Ikram; Figueiredo, Rosa; Poss, Michael; Zhou, Fen: Minimizing energy and link utilization in ISP backbone networks with multi-path routing: a bi-level approach (2020)
  3. Fontaine, Pirmin; Crainic, Teodor Gabriel; Gendreau, Michel; Minner, Stefan: Population-based risk equilibration for the multimode hazmat transport network design problem (2020)
  4. Dos Reis, Daniel Morais; Goulart, Natã; Noronha, Thiago F.; De Souza, Sérgio Ricardo: On the problem of minimizing the cost with optical devices in wavelength division multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics (2019)
  5. Matthews, Logan R.; Gounaris, Chrysanthos E.; Kevrekidis, Ioannis G.: Designing networks with resiliency to edge failures using two-stage robust optimization (2019)
  6. Mejri, Imen; Haouari, Mohamed; Layeb, Safa Bhar; Mansour, Farah Zeghal: An exact approach for the multicommodity network optimization problem with a step cost function (2019)
  7. Wang, Guanglei; Ben-Ameur, Walid; Ouorou, Adam: A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines (2019)
  8. Agarwal, Y. K.: Network loading problem: valid inequalities from 5- and higher partitions (2018)
  9. Coudert, David; Luedtke, James; Moreno, Eduardo; Priftis, Konstantinos: Computing and maximizing the exact reliability of wireless backhaul networks (2018)
  10. Lei, Xiao; Shen, Siqian; Song, Yongjia: Stochastic maximum flow interdiction problems under heterogeneous risk preferences (2018)
  11. Lodi, Andrea; Moradi, Ahmad: Experiments on virtual private network design with concave capacity costs (2018)
  12. Mattia, Sara; Poss, Michael: A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation (2018)
  13. Pióro, Michał; Kalesnikau, Ilya; Poss, Michael: Path generation for affine flow thinning (2018)
  14. Silva, Marco; Poss, Michael; Maculan, Nelson: (k)-adaptive routing for the robust network loading problem (2018)
  15. Fortz, Bernard; Gouveia, Luís; Joyce-Moniz, Martim: Models for the piecewise linear unsplittable multicommodity flow problems (2017)
  16. Monemi, Rahimeh Neamatian; Gelareh, Shahin: The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach (2017)
  17. Nakao, Hideaki; Shen, Siqian; Chen, Zhihao: Network design in scarce data environment using moment-based distributionally robust optimization (2017)
  18. Ayoub, Josette; Poss, Michael: Decomposition for adjustable robust linear optimization subject to uncertainty polytope (2016)
  19. 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)
  20. Cacchiani, Valentina; Jünger, Michael; Liers, Frauke; Lodi, Andrea; Schmidt, Daniel R.: Single-commodity robust network design with finite and hose demand sets (2016)

1 2 3 4 next