A polynomially bounded algorithm for a singly constrained quadratic program (Q3899825): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3865860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Search: Optimum Distribution of Search Effort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Allocation of Effort Resources among Competing Activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an Allocation Problem with Multistage Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Problem in Optimum Allocation / rank
 
Normal rank

Latest revision as of 11:23, 13 June 2024

scientific article
Language Label Description Also known as
English
A polynomially bounded algorithm for a singly constrained quadratic program
scientific article

    Statements

    A polynomially bounded algorithm for a singly constrained quadratic program (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1980
    0 references
    0 references
    singly constrained quadratic program
    0 references
    Kuhn-Tucker conditions
    0 references
    binary search
    0 references
    linear interpolation
    0 references
    polynomial algorithm
    0 references