A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229)

From MaRDI portal
Revision as of 17:50, 2 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A binarisation heuristic for non-convex quadratic programming with box constraints
scientific article

    Statements

    A binarisation heuristic for non-convex quadratic programming with box constraints (English)
    0 references
    0 references
    0 references
    10 February 2020
    0 references
    global optimisation
    0 references
    heuristics
    0 references
    integer programming
    0 references

    Identifiers