Testset B

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

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

The original data sets are from the OR-Library.

Name   |V|    |E|    |T|    DC    Opt
b0150 63 Ls 82
b0250 63 13 Ls 83
b0350 63 25 Ls 138
b0450 100 Ls 59
b0550 100 13 Ls 61
b0650 100 25 Ps 122
b0775 94 13 Ls 111
b0875 94 19 Ls 104
b0975 94 38 Ls 220
b1075 150 13 Ps 86
b1175 150 19 Ls 88
b1275 150 38 Ls 174
b13100 125 17 Ps 165
b14100 125 25 Ps 235
b15100 125 50 Ps 318
b16100 200 17 Ps 127
b17100 200 25 Ps 131
b18100 200 50 Ps 218

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