Problem nobel-us--U-U-E-N-C-A-N-N


Problem download: native.zip / tgz, xml.zip / tgz
Network show source: native / xml
Model show source: native / xml
Nodes 14
Links 21
Demands 91
Problem statistics show details...
Network image show image...
Problem export GML  (see GML format)
Originator EU-Project NOBEL, http://www.ist-nobel.org
Contributor Ralf Huelsermann, T-Systems International AG
Submission date 17.10.2005
Submit new solution or dual bound go...

Solutions provided to SNDlib:

objective contributor submission date additional information
2506530.00 Sebastian Orlowski 20.12.2005 taken from nobel-us--U-U-E-N-I-A-N-N
2506240.00 Christian Raack 06.11.2006 edge-flow formulation, CPLEX 10.0 plus flow-cutset inequalities, 9:50 minutes to optimality
2506240.00 Christian Raack 06.11.2006 edge-flow formulation, CPLEX 10.0, 6:40 minutes to optimality

statistics about all solutions

Dual bounds provided to SNDlib:

dual bound contributor submission date additional information
2506240.00 Christian Raack 06.11.2006 edge-flow formulation, CPLEX 10.0, 6:40 minutes to optimality
2504871.67 Sebastian Orlowski 19.12.2005 path-flow LP with column generation, B&C with metric inequalities, 9:50 minutes to optimality

Note: we encourage you to submit dual bounds to a problem if you have them. However, in contrast to primal solutions, we cannot check dual bounds for validity, which is why dual bounds are only listed here together with their contributor.



Image of the network:


image of the network

© 2006 Zuse-Institute Berlin (ZIB)
http://www.zib.de