A FPTAS for a class of linear multiplicative problems (Q849090): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicative programming problems: Analysis and efficient point search heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outcome-space cutting-plane algorithm for linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Image space analysis of generalized fractional programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outcome-space finite algorithm for solving linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic programming and combinatorial minimum weight product problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric simplex algorithms for solving a special class of nonconvex minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite branch-and-bound algorithm for linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer approximation method for minimizing the product of several convex functions on a convex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic methods for linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(NP\)-hardness of linear multiplicative programming and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithms for some classes of constrained nonconvex quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-reduce approach to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of multiplicative programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite algorithm for generalized linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for indefinite quadratic programming / rank
 
Normal rank

Revision as of 11:19, 2 July 2024

scientific article
Language Label Description Also known as
English
A FPTAS for a class of linear multiplicative problems
scientific article

    Statements

    A FPTAS for a class of linear multiplicative problems (English)
    0 references
    0 references
    0 references
    24 February 2010
    0 references
    parametric analysis
    0 references
    approximation problem
    0 references
    0 references

    Identifiers