| Name | stp3d |
| Download | stp3d.mps.gz |
| Orginator | ZIB |
| Formulator | David Grove Joergensen, Thorsten Koch |
| Donator | Thorsten Koch |
| Rows | 159488 |
| Cols | 204880 |
| Non-zeros | 662128 |
| Integers | |
| Binaries | 204880 |
| Continuous | |
| |Min| | 1.00000000e+00 |
| |Max| | 1.00000000e+00 |
| Integer Objective | Unknown |
| LP Objective | 481.877787 |
| Root LP Basis | stp3d.bas.gz |
| Set partitioning | 82 |
| Set packing | 131403 |
| Set covering | |
| Cardinality | 28003 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Upper bounds | |
| Lower bounds | |
| Mixed 0/1 | |
| General Cons. | |
| References | Koch2004 Vazacopoulos2006 |
3D Steiner Tree packing problem (VLSI routing problem in a multi-layer grid graph)
Alkis Vazacopoulos reports finding the first feasible solution of this instance using XPRESS 2006B.