   Testset P6Z

These instances are random generated sparse graphs with random weights. The were introduced in CGR92 .

Name   |V|    |E|    |T|    DC    Opt
p601100 180 Ps ----
p602100 180 Ps 8083
p603100 180 Ps 5022
p604100 180 10 Ps 11397
p605100 180 10 Ps 10355
p606100 180 10 Ps 13048
p607100 180 20 Ls 15358
P608100 180 20 Ls 14439
p609100 180 20 Ps 18263
p610100 180 50 Ps 30161
p611100 180 50 Ls 26903
p612100 180 50 Ps 30258
p613200 370 10 Ps 18429
p614200 370 20 Ps 27276
p615200 370 40 Ps 42474
p616200 370 100 Ps 62263

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