SP-graphs for IP/OSPF network design

This page contains data for Shortest Path graphs (SP-graphs) for IP/OSPF network design, as described in the following articles. For more detailed information, contact Kaj Holmberg.

Any use of these problem data should be accompanied with a reference to (the most relevant of) the articles above. You might also want to send me an email.

We have used Vineopt in the process of generating the instances. Some of the instances are based on data from SNDlib, however much simplified.

Download all data in a zip-file.

Kaj Holmberg, email: kaj.holmberg@liu.se, homepage: http://www.kajh.se.
Division of Optimization, Department of Mathematics, Linköping Institute of Technology, SE-581 83 Linköping, SWEDEN.