A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem (Q881518): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2006.08.036 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2026971626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Maximizing a Sum of Ratios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3204321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrange duality and partitioning techniques in nonconvex global optimization / 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: Image space analysis of generalized fractional programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889854 / 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: BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of a generalized convex multiplicative function / 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: A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems / 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: A unified monotonic approach to generalized linear fractional programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization algorithm for linear fractional and bilinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Analysis and Mathematical Programming / 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: Convergence and application of a decomposition method using duality bounds for nonconvex global optimization / rank
 
Normal rank

Latest revision as of 20:19, 25 June 2024

scientific article
Language Label Description Also known as
English
A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
scientific article

    Statements

    A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem (English)
    0 references
    0 references
    30 May 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    global optimization
    0 references
    fractional programming
    0 references
    sum-of-ratios
    0 references
    branch and bound
    0 references
    duality bounds
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references