Problem class 04
Steiner Tree Packing
VLSI Design / Wire Routing
Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.
190
Instances
78
Model files
44
Solution files
0
Result rows
Why benchmark these instances
Steiner Packing
A routing benchmark for packing disjoint connection structures through constrained grid geometry.
Contribute results
Submit a Steiner Packing result
Have a better bound, a new feasible solution, a quantum run, or a useful negative result? QOBLIB accepts benchmark submissions by pull request using the canonical summary CSV template.
Submission sets
Top-level community submission directories for this problem class.
| Problem | Submission set | Submitter | Date key | Instances | Rows | Source |
|---|
Result rows
Parsed instance-level summary CSV rows for this problem class.
| Problem | Instance | Submission | Submitter | Date | Objective | Model | Algorithm | Total runtime | Source |
|---|