Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints (Q3352817): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| 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.1137/0403043 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2148237104 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:38, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints |
scientific article |
Statements
Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints (English)
0 references
1990
0 references
polynomial combinatorics
0 references
unreliable nodes and edges
0 references
design problems for communication networks
0 references
survivability
0 references
minimum cost design
0 references
polyhedral approach
0 references
facet defining inequalities
0 references
minimum spanning trees
0 references
Steiner tree
0 references
edge connectivity constraints
0 references
