Commit 79fe5b91 authored by MIPLIB Submitter's avatar MIPLIB Submitter

New submission at 2017-05-10 15:56:13.919290

parent b24bd3ad
company: TU Berlin
creator: Daniel Rehfeldt
description: Steiner tree problem in graphs instance, consisting of a complete graph
with 231 vertices of which 50 are terminals. The vertices correspond to cities (mostly
capitals) around the world, the edges weights correspond to the distances in km.
license: cc-license
misc: ''
name: Daniel Rehfeldt
other-license: ''
owner: Daniel Rehfeldt
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment