A class of extremal combinatorial problems for multicomponent network design (Q1084025)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A class of extremal combinatorial problems for multicomponent network design |
scientific article; zbMATH DE number 3976811
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A class of extremal combinatorial problems for multicomponent network design |
scientific article; zbMATH DE number 3976811 |
Statements
A class of extremal combinatorial problems for multicomponent network design (English)
0 references
1986
0 references
We introduce and investigate a class of optimal network design problems. An extremal combinatorial model is used in order to classify these problems by complexity. A branch-and-bound basic computational scheme is proposed for the solution of these problems.
0 references
complexity classification
0 references
optimal network design
0 references
branch-and-bound
0 references
0.770613431930542
0 references
0.7631889581680298
0 references