Integer programming formulations for the two 4-hop-constrained paths problem (Q3428909)
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 5138938
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Integer programming formulations for the two 4-hop-constrained paths problem |
scientific article; zbMATH DE number 5138938 |
Statements
Integer programming formulations for the two 4-hop-constrained paths problem (English)
0 references
30 March 2007
0 references
survivable network
0 references
edge-disjoint paths
0 references
node-disjoint paths
0 references
hop-constraint
0 references
0.8577188849449158
0 references
0.8536450862884521
0 references
0.8215258717536926
0 references
0.8131254315376282
0 references
