Integer programming formulations for the two 4-hop-constrained paths problem (Q3428909): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Q210514 / rank | |||
| Property / author | |||
| Property / author: Ali Ridha Mahjoub / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.20147 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4241397890 / rank | |||
Normal rank | |||
| 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 | |||
| links / mardi / name | links / mardi / name | ||
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
