A Nonlinear Programming Heuristic for Computing Optimal Link Capacities in a Multi-Hour Alternate Routing Communications Network (Q3763870)

From MaRDI portal
Revision as of 21:08, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    1987
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references