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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0167-6377(93)90041-e / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997012643 / rank
 
Normal rank

Latest revision as of 09:08, 30 July 2024

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

    Statements

    Identifiers