A Nonlinear Programming Heuristic for Computing Optimal Link Capacities in a Multi-Hour Alternate Routing Communications Network (Q3763870)
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 Nonlinear Programming Heuristic for Computing Optimal Link Capacities in a Multi-Hour Alternate Routing Communications Network |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Nonlinear Programming Heuristic for Computing Optimal Link Capacities in a Multi-Hour Alternate Routing Communications Network |
scientific article |
Statements
A Nonlinear Programming Heuristic for Computing Optimal Link Capacities in a Multi-Hour Alternate Routing Communications Network (English)
0 references
1987
0 references
optimal number of communications channels
0 references
telecommunications network
0 references
integer nonlinear programming
0 references
recursive quadratic programming
0 references
exact penalty function
0 references
