Goto ZIB Goto TU-Braunschweig Goto TU-Darmstadt

Testset ALUE

These instances are grid graphs with rectangular holes. They come from a VLSI application (see JMRW94 ).

They were introduced in KM98 . More information can be found among others in UdAR99 PD00 , and PV01c .

Here is an image of alue7080 PS DjVu with solution made by E. Uchoa .

This is a picture of diw0495 with solution. diw0495 with solution

The files can be found in the download section.

Name   |V|    |E|    |T|    DC    Opt 
 alue20871244 1971 34 Ps 1049 
 alue21051220 1858 34 Ps 1032 
 alue31463626 5869 64 NPs 2240 
 alue50673524 5560 68 Ns 2586 
 alue53455179 8165 68 NPs 3507 
 alue56234472 6938 68 NPs 3413 
 alue590111543 18429 68 Ps 3912 
 alue61793372 5213 67 NPs 2452 
 alue64573932 6137 68 Ps 3057 
 alue67354119 6696 68 Ps 2696 
 alue69512818 4419 67 Ps 2386 
 alue706534046 54841 544 Pm 23881 
 alue70666405 10454 16 Ps 2256 
 alue708034479 55494 2344 NPm 62449 
 alue7229940 1474 34 Ps 824 

The column DC classifies the difficulty of the instance.

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.
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.
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)