The widest<i>k</i>-set of disjoint paths problem (Q5880971)
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 7661208
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The widest<i>k</i>-set of disjoint paths problem |
scientific article; zbMATH DE number 7661208 |
Statements
The widest<i>k</i>-set of disjoint paths problem (English)
0 references
9 March 2023
0 references
widest paths
0 references
disjoint paths
0 references
network flows
0 references
integer programming
0 references
heuristics
0 references
0 references
0.8988707
0 references
0.89462745
0 references
0.89385754
0 references
0 references
0 references
0.88342845
0 references
