The quadratic shortest path problem: complexity, approximability, and solution methods (Q1754341)

From MaRDI portal
Revision as of 17:33, 15 July 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
The quadratic shortest path problem: complexity, approximability, and solution methods
scientific article

    Statements

    The quadratic shortest path problem: complexity, approximability, and solution methods (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 May 2018
    0 references
    combinatorial optimization
    0 references
    shortest path problem
    0 references
    quadratic 0-1 optimization
    0 references
    computational complexity
    0 references
    branch-and-bound
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references