Survivable networks, linear programming relaxations and the parsimonious property (Q689117)
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 440072
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Survivable networks, linear programming relaxations and the parsimonious property |
scientific article; zbMATH DE number 440072 |
Statements
Survivable networks, linear programming relaxations and the parsimonious property (English)
0 references
6 December 1993
0 references
worst-case analysis
0 references
heuristics
0 references
survivable network design
0 references
edge- connectivity requirements
0 references
Steiner tree
0 references
traveling salesman
0 references
\(k\)-edge- connected network design
0 references
parsimonious property
0 references
0 references
0 references
0 references
0.8384367227554321
0 references
0.8384367227554321
0 references
0.8342607021331787
0 references
0.8339314460754395
0 references
