Solving the continuous nonlinear resource allocation problem with an interior point method (Q1785268): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An O(n) algorithm for quadratic knapsack problems / 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: Breakpoint searching algorithms for the continuous quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Massively Parallel Algorithms for Singly Constrained Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on the continuous nonlinear resource allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the continuous quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Newton-type algorithm for solving problems of search theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving certain singly constrained convex optimization problems in production planning / rank
 
Normal rank

Latest revision as of 16:44, 16 July 2024

scientific article
Language Label Description Also known as
English
Solving the continuous nonlinear resource allocation problem with an interior point method
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references