Quadratic programming and combinatorial minimum weight product problems (Q985315): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized concavity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3873927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for a class of minimum rank-two cost path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic programming with one negative eigenvalue is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for indefinite quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137900 / rank
 
Normal rank

Latest revision as of 01:37, 3 July 2024

scientific article
Language Label Description Also known as
English
Quadratic programming and combinatorial minimum weight product problems
scientific article

    Statements

    Quadratic programming and combinatorial minimum weight product problems (English)
    0 references
    0 references
    0 references
    21 July 2010
    0 references
    0 references
    quadratic programming
    0 references
    approximation scheme
    0 references
    shortest path
    0 references
    0 references