Goto ZIB Goto TU-Braunschweig Goto TU-Darmstadt

Testset D

These instances are random generated sparse graphs with edge weights between 1 and 10.

The were introduced in Bea89 and were generated following a scheme outlined in Ane80 . More information is among others in Luc93 , KM98 , PD00 .

The original data sets are from the OR-Library.

The files can be found in the download section.

Name   |V|    |E|    |T|    DC    Opt 
 d011000 1250 5 Ps 106 
 d021000 1250 10 Ps 220 
 d031000 1250 167 Ps 1565 
 d041000 1250 250 Ps 1935 
 d051000 1250 500 Ps 3250 
 d061000 2000 5 Ps 67 
 d071000 2000 10 Ps 103 
 d081000 2000 167 Ps 1072 
 d091000 2000 250 Ps 1448 
 d101000 2000 500 Ps 2110 
 d111000 5000 5 Pm 29 
 d121000 5000 10 Pm 42 
 d131000 5000 167 Ps 500 
 d141000 5000 250 Ps 667 
 d151000 5000 500 Ps 1116 
 d161000 25000 5 Pm 13 
 d171000 25000 10 Pm 23 
 d181000 25000 167 Ps 223 
 d191000 25000 250 Ps 310 
 d201000 25000 500 Ls 537 

The column DC classifies the difficulty of the instance.

L
Solvable by usage of local preprocessing. Typical examples are the SD-Test, BD-n Tests and FST computations. Neither a global upper nor lower bound needs to be computed.
P
Solvable by polynomial time algorithms, like dual ascent in combination with primal heuristic, a integral LP formulation or advanced preprocessing like reduced cost criteria or the RCR-Test.
NP
No polynomial time algorithm is known. Use of an exponential time enumeration sceme like Branch-and-Bound is neccessary.

The letter after class gives an impression how long it takes to solve the problem using state-of-the-art soft- and hardware. secounds means less than a minute (this includes instances which can be solved in fractions of a second). minutes means less than an hour. hours is less than a day and days is less than a week. weeks mean it takes really a long time to solve this instance. ? means the instance is not solved or the time is not known.

If the number in the Opt column is written in italics the optimum is not known. The number given is the best know upper bound.

Last Update : 2015/02/11 11:57:20 $ by Thorsten Koch
© 2001 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
URL: http://www.zib.de