Routing in grid graphs by cutting planes (Q4845139): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3972951 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4023738 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Multicommodity flows in graphs / rank | |||
Normal rank | |||
Revision as of 17:06, 23 May 2024
scientific article; zbMATH DE number 792631
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Routing in grid graphs by cutting planes |
scientific article; zbMATH DE number 792631 |
Statements
Routing in grid graphs by cutting planes (English)
0 references
30 May 1996
0 references
Steiner tree
0 references
cutting plane algorithm
0 references
weighted routing
0 references
routing problem in VLSI-design
0 references
branch and cut algorithm
0 references
switchbox routing
0 references
