Problem nobel-eu--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 28
Links 41
Demands 378
Problem statistics show details...
Network image show image...
Problem export GML  (see GML format)
Originator EU-Project NOBEL, http://www.ist-nobel.org
Contributor Monika Jaeger, 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
1290100.00 Christian Raack 06.11.2006 edge-flow formulation, CPLEX 10.0 plus flow-cutset inequalities, time limit 1h
1051360.00 Christian Raack 06.11.2006 edge-flow formulation, CPLEX 10.0, time limit 1h
879820.00 Sebastian Orlowski 20.12.2005 path-flow LP with column generation, B&C with metric inequalities, time limit 1h
879520.00 Sebastian Orlowski 17.08.2006 path-flow LP with column generation, B&C with metric inequalities, time limit 1h

statistics about all solutions

Dual bounds provided to SNDlib:

dual bound contributor submission date additional information
845942.78 Sebastian Orlowski 17.08.2006 path-flow LP with column generation, B&C with metric inequalities, time limit 1h
837623.20 Christian Raack 06.11.2006 edge-flow formulation, CPLEX 10.0 plus flow-cutset inequalities, time limit 1h
831080.92 Christian Raack 06.11.2006 edge-flow formulation, CPLEX 10.0, 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