Problem dfn-bwin--U-U-E-N-S-A-N-N
Solutions provided to SNDlib:
108584.99
|
Sebastian Orlowski |
20.12.2005 |
path-flow LP with column generation, B&C with metric inequalities, time limit 1h
|
86897.79
|
Mats Petter Pettersson |
24.05.2006 |
Constraint programming branch and bound, using previous best known solution from website (108584.993) as initial bound. Time limit 10 seconds
|
statistics about all solutions
Dual bounds provided to SNDlib:
71169.25 |
Christian Raack |
06.11.2006 |
taken from dfn-bwin--U-U-E-N-C-A-N-N
|
64536.31 |
Sebastian Orlowski |
19.12.2005 |
taken from dfn-bwin--U-U-E-N-C-A-N-N
|
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:
© 2006 Zuse-Institute Berlin (ZIB)
http://www.zib.de