An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming (Q6099489): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cam.2023.115100 / 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: Robust Optimization of Large-Scale Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized convexity and optimization. Theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimization of a class of generalized linear functions on a flow polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilinear separation of two sets in \(n\)-space / 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: A new global optimization approach for convex multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method of acceleration for a class of multiplicative programming problems with exponent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization algorithm for a generalized linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization approach for solving generalized nonlinear multiplicative programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practicable branch-and-bound algorithm for globally solving linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global algorithm for solving linear multiplicative programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization for generalized linear multiplicative programming using convex relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of a generalized linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outer space branch and bound algorithm for solving linear multiplicative programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization algorithm for solving linear multiplicative programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global algorithm for a class of multiplicative programs using piecewise linear approximation technique / 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: An outcome space approach for generalized convex 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: Outcome-space cutting-plane algorithm for linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization algorithm for mixed integer quadratically constrained quadratic program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Range division and compression algorithm for quadratically constrained sum of quadratic ratios / rank
 
Normal rank
Property / cites work
 
Property / cites work: A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic methods for linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse polyblock approximation for generalized multiplicative/fractional programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a class of generalized fractional programming problems using the feasibility of linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear decomposition approach for a class of nonconvex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for globally solving generalized linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Quadratic Sum-of-Ratios Fractional Programs Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: BARON: A general purpose global optimization software package / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(NP\)-hardness of linear multiplicative programming and related problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.CAM.2023.115100 / rank
 
Normal rank

Latest revision as of 18:26, 30 December 2024

scientific article; zbMATH DE number 7698151
Language Label Description Also known as
English
An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
scientific article; zbMATH DE number 7698151

    Statements

    An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming (English)
    0 references
    0 references
    0 references
    0 references
    20 June 2023
    0 references
    linear multiplicative programming
    0 references
    second order cone relaxation
    0 references
    adaptive branching
    0 references
    branch-and-bound
    0 references
    piecewise linear approximation
    0 references
    0 references

    Identifiers