A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems (Q2479840): 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: Q3323698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Separable Nonconvex Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for nonconvex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to global optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization on low rank nonconvex structures / 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: Q5462190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian based branch-and-bound algorithm for production-transportation problems / 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: A SIMPLICIAL BRANCH-AND-BOUND ALGORITHM FOR PRODUCTION-TRANSPORTATION PROBLEMS WITH INSEPARABLE CONCAVE PRODUCTION COST / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of multiplicative programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly polynomial time algorithms for certain concave minimization problems on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables / rank
 
Normal rank

Revision as of 19:44, 27 June 2024

scientific article
Language Label Description Also known as
English
A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems
scientific article

    Statements

    A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems (English)
    0 references
    0 references
    0 references
    3 April 2008
    0 references
    Global optimization
    0 references
    Concave minimization
    0 references
    Low-rank nonconvexity
    0 references
    Branch-and-bound algorithm
    0 references
    Lagrangian relaxation
    0 references

    Identifiers