An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
From MaRDI portal
Publication:6099489
Recommendations
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
- An outcome space branch-and-bound algorithm for a class of linear multiplicative programming problems
- Outer space branch and bound algorithm for solving linear multiplicative programming problems
- Global algorithm for solving linear multiplicative programming problems
- A finite branch-and-bound algorithm for linear multiplicative programming
Cites work
- \(NP\)-hardness of linear multiplicative programming and related problems
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
- A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints
- A global optimization approach for solving generalized nonlinear multiplicative programming problem
- A method of acceleration for a class of multiplicative programming problems with exponent
- A new global optimization approach for convex multiplicative programming
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
- An efficient algorithm for globally solving generalized linear multiplicative programming
- An Efficient algorithm for quadratic sum-of-ratios fractional programs problem
- An outcome space approach for generalized convex multiplicative programs
- An outer approximation method for minimizing the product of several convex functions on a convex set
- BARON: A general purpose global optimization software package
- Bilinear separation of two sets in n-space
- Finite algorithm for generalized linear multiplicative programming
- Generalized convexity and optimization. Theory and applications
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique
- Global algorithm for solving linear multiplicative programming problems
- Global minimization of a generalized linear multiplicative programming
- Global optimization algorithm for a generalized linear multiplicative programming
- Global optimization algorithm for mixed integer quadratically constrained quadratic program
- Global optimization algorithm for solving linear multiplicative programming problems
- Global optimization for generalized linear multiplicative programming using convex relaxation
- Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
- Heuristic methods for linear multiplicative programming
- scientific article; zbMATH DE number 1054671 (Why is no real title available?)
- Linear decomposition approach for a class of nonconvex programming problems
- On the minimization of a class of generalized linear functions on a flow polytope
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Outer space branch and bound algorithm for solving linear multiplicative programming problems
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios
- Reverse polyblock approximation for generalized multiplicative/fractional programming
- Robust Optimization of Large-Scale Systems
- Solving a class of generalized fractional programming problems using the feasibility of linear programs
- Solving long-term financial planning problems via global optimization
Cited in
(19)- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
- An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation
- An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs
- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications
- A criterion space algorithm for solving linear multiplicative programming problems
- A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming
- A novel branch and bound algorithm for solving the linear multiplicative programming problems
- A hybrid relaxation method for solving generalized linear fractional programs
- An efficient outcome-space branch-and-bound algorithm for solving a class of large-scale linear multiplicative programs
- A novel global algorithm for solving linear multiplicative problem by integrating linear combination rule and branch-and-bound framework
- Output-space branch-and-bound reduction algorithm for solving generalized linear multiplicative programming programs
- An outer space branch-reduction-bound algorithm using second-order cone relaxation with regional reduction strategy for solving equivalent generalized linear multiplicative programming
- An outcome space algorithm for solving general linear multiplicative programming
- Optimizing generalized linear fractional program using the image space branch-reduction-bound scheme
- Output-space branch-and-bound algorithm adopting an adaptive branching rule for solving general linear fractional-multiplicative programs
- An outer space approximation approach for generalized affine multiplicative programming problems
- Globally minimizing a class of linear multiplicative programming under the flexible branching scheme
- Convex relaxation technique-based output space branch-reduction-bound algorithm for minimizing generalized linear fractional multiplicative programs
- A spatial global optimization algorithm for generalized fractional programming problems using second-order cone relaxation
This page was built for publication: An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6099489)
