A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935)

From MaRDI portal
Revision as of 02:20, 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
A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
scientific article

    Statements

    A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (English)
    0 references
    0 references
    0 references
    0 references
    9 February 2018
    0 references
    quadratic binary programming
    0 references
    Lagrangian decomposition
    0 references
    preprocess
    0 references
    quadratic assignment problem
    0 references
    0 references
    0 references
    0 references

    Identifiers