An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs

Cites Work

Unnamed Item
An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
Global maximization of a generalized concave multiplicative function
Practical global optimization for multiview geometry
An outcome space approach for generalized convex multiplicative programs
Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
A mean-absolute deviation-skewness portfolio optimization model
Bilinear separation of two sets in \(n\)-space
Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
Outcome-space cutting-plane algorithm for linear multiplicative programming
A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
Global optimization for generalized linear multiplicative programming using convex relaxation
BARON: A general purpose global optimization software package
Outer space branch and bound algorithm for solving linear multiplicative programming problems
A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
Global algorithm for solving linear multiplicative programming problems
Global optimization method for linear multiplicative programming
Global optimization algorithm for a generalized linear multiplicative programming
\(NP\)-hardness of linear multiplicative programming and related problems
On the minimization of a class of generalized linear functions on a flow polytope
A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
The Bargaining Problem
Robust Optimization of Large-Scale Systems
A new solution method for a class of large dimension rank-two nonconvex programs
Global optimization algorithm for solving linear multiplicative programming problems
On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
Two-Person Cooperative Games
Convex analysis and global optimization
Solving linear multiplicative programs via branch-and-bound: a computational experience
An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound
Platform responses to entry in a local market with mobile providers

This page was built for publication: An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs