Integer programming formulations for the two 4-hop-constrained paths problem (Q3428909): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q325407 |
||
Property / author | |||
Property / author: Q210514 / rank | |||
Revision as of 07:06, 13 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Integer programming formulations for the two 4-hop-constrained paths problem |
scientific article |
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