Exact approaches for the minimum subgraph diameter problem (Q2108148)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7634092
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact approaches for the minimum subgraph diameter problem |
scientific article; zbMATH DE number 7634092 |
Statements
Exact approaches for the minimum subgraph diameter problem (English)
0 references
19 December 2022
0 references
combinatorial optimization
0 references
network design
0 references
integer linear programming
0 references
branch-and-cut
0 references
benchmark instances
0 references
0 references
0 references
0.78609299659729
0 references
0.7469555139541626
0 references
0.7374574542045593
0 references
0.7343324422836304
0 references
0.7319124937057495
0 references
