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

From MaRDI portal
Revision as of 23:08, 5 November 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129270668, #quickstatements; #temporary_batch_1730844483834)
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
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers