Integer programming formulations for the two 4-hop-constrained paths problem (Q3428909): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3097395 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut / rank | |||
Normal rank | |||
Latest revision as of 16:40, 25 June 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
