An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem (Q691453): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Using concave envelopes to globally solve the nonlinear sum of ratios problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conical partition algorithm for maximizing the sum of dc ratios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving sum-of-ratios fractional programs using efficient points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the sum-of-ratios problem by an interior-point method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of the sum of three linear fractional functions / 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: Parametric simplex algorithms for solving a special class of nonconvex minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4266762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for maximizing the sum of several linear ratios / 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: Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of fractional programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified monotonic approach to generalized linear fractional programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complexity of unconstrained hyperbolic 0--1 programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the sum of a linear and linear-fractional function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional programming: The sum-of-ratios case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined algorithm for fractional programming / rank
 
Normal rank

Revision as of 22:16, 5 July 2024

scientific article
Language Label Description Also known as
English
An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem
scientific article

    Statements

    An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem (English)
    0 references
    0 references
    0 references
    0 references
    30 November 2012
    0 references
    sum-of-linear (nonlinear)-ratios problem
    0 references
    \({\mathcal{NP}}\)-hard
    0 references
    branch-and-bound approach
    0 references

    Identifiers