Integer programming formulations for the two 4-hop-constrained paths problem (Q3428909): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:46, 4 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
