Approximate vs. exact algorithms to solve the maximum line length problem (Q2743667)

From MaRDI portal
Revision as of 20:08, 3 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Approximate vs. exact algorithms to solve the maximum line length problem
scientific article

    Statements

    Approximate vs. exact algorithms to solve the maximum line length problem (English)
    0 references
    0 references
    0 references
    0 references
    6 November 2001
    0 references
    0 references
    0 references
    0 references
    0 references
    optimization
    0 references
    queueing system
    0 references
    nonlinear programming
    0 references
    gradient projection method
    0 references
    maximum line length
    0 references
    multiservice system
    0 references
    numerical experiments
    0 references
    algorithms
    0 references
    0 references