Problem ta1--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 24
55
Demands 396
Problem statistics show details...
Network image show image...
Problem export GML  (see GML format)
Originator Telekom Austria, http://www.telekom.at
Contributor Franz Serajnik, Telekom Austria
Submission date 17.10.2005
Submit new solution or dual bound go...

Solutions provided to SNDlib:

objective contributor submission date additional information
8004807.93 Christian Raack 06.11.2006 edge-flow formulation, CPLEX 10.0, time limit 1h
7695229.30 Sebastian Orlowski 20.12.2005 taken from ta1--U-U-E-N-C-A-Y-N
7577295.21 Christian Raack 06.11.2006 edge-flow formulation, CPLEX 10.0 plus flow-cutset inequalities, time limit 1h

statistics about all solutions


Dual bounds provided to SNDlib:

dual bound contributor submission date additional information
7236389.82 Christian Raack 06.11.2006 edge-flow formulation, CPLEX 10.0 plus flow-cutset inequalities, 2 minutes to optimality
6429484.83 Christian Raack 06.11.2006 edge-flow formulation, CPLEX 10.0, time limit 1h
6385112.99 Sebastian Orlowski 19.12.2005 path-flow LP with column generation, B&C with metric inequalities, time limit 1h

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