Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time (Q2364490): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3649086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally solving nonconvex quadratic programming problems via completely positive programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Newton's method for the continuous quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient global algorithm for a class of indefinite separable quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of concave knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Where are the hard knapsack problems? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the continuous quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local minima for indefinite quadratic knapsack problems / rank
 
Normal rank

Latest revision as of 03:40, 14 July 2024

scientific article
Language Label Description Also known as
English
Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time
scientific article

    Statements

    Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time (English)
    0 references
    0 references
    21 July 2017
    0 references
    separable quadratic optimization
    0 references
    indefinite knapsack problems
    0 references
    lower and upper bounds
    0 references
    linear-time complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers