Linear time algorithms for some separable quadratic programming problems (Q688207): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
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: Linear programming in \(O(n\times 3^{d^2})\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for the multiple-choice knapsack linear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4286721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming in Linear Time When the Dimension Is Fixed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for the linear multiple choice knapsack problem and related problems / rank
 
Normal rank

Revision as of 10:34, 22 May 2024

scientific article
Language Label Description Also known as
English
Linear time algorithms for some separable quadratic programming problems
scientific article

    Statements

    Linear time algorithms for some separable quadratic programming problems (English)
    0 references
    0 references
    0 references
    28 November 1993
    0 references
    separable quadratic programming
    0 references
    separable convex quadratic transportation
    0 references

    Identifiers