A new accelerating method for globally solving a class of nonconvex programming problems (Q923946): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.na.2009.01.142 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A branch and bound algorithm for globally solving a class of nonconvex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving long-term financial planning problems via global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Optimization of Large-Scale Systems / 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 simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm to globally solve the sum of several linear ratios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of generalized linear fractional programming with nonlinear constraints / 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: Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints / 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: A new rectangle branch-and-pruning approach for generalized geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic global optimization algorithm for generalized geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prediction of oligopeptide conformations via deterministic global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearization method for a class of multiplicative programming with exponent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and global optimization / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.NA.2009.01.142 / rank
 
Normal rank

Latest revision as of 08:15, 10 December 2024

scientific article
Language Label Description Also known as
English
A new accelerating method for globally solving a class of nonconvex programming problems
scientific article

    Statements

    A new accelerating method for globally solving a class of nonconvex programming problems (English)
    0 references
    0 references
    0 references
    0 references
    24 July 2009
    0 references
    deleting technique
    0 references
    branch and bound
    0 references

    Identifiers