An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem (Q5270754)

From MaRDI portal
Revision as of 17:48, 21 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6738143
Language Label Description Also known as
English
An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem
scientific article; zbMATH DE number 6738143

    Statements

    An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem (English)
    0 references
    0 references
    0 references
    0 references
    30 June 2017
    0 references
    continuous quadratic knapsack
    0 references
    convex programming
    0 references
    heap
    0 references
    nonlinear programming
    0 references
    quadratic programming
    0 references
    separable programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references