An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs
From MaRDI portal
Publication:6581973
Recommendations
- Global optimization algorithm for a generalized linear multiplicative programming
- A branch and bound algorithm for solving a class of generalized linear multiplicative programming problems
- Global algorithm for solving linear multiplicative programming problems
- An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation
- A novel branch-and-bound algorithm for solving linear multiplicative programming problems
Cites work
- scientific article; zbMATH DE number 1054671 (Why is no real title available?)
- 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
- A mean-absolute deviation-skewness portfolio optimization model
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
- A new solution method for a class of large dimension rank-two nonconvex programs
- A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- An outcome space approach for generalized convex multiplicative programs
- BARON: A general purpose global optimization software package
- Bilinear separation of two sets in \(n\)-space
- Convex analysis and global optimization
- Global algorithm for solving linear multiplicative programming problems
- Global maximization of a generalized concave multiplicative function
- Global optimization algorithm for a generalized linear multiplicative programming
- Global optimization algorithm for solving linear multiplicative programming problems
- Global optimization for generalized linear multiplicative programming using convex relaxation
- Global optimization method for linear multiplicative programming
- Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
- Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- 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
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
- Platform responses to entry in a local market with mobile providers
- Practical global optimization for multiview geometry
- Robust Optimization of Large-Scale Systems
- Solving linear multiplicative programs via branch-and-bound: a computational experience
- The bargaining problem
- Two-Person Cooperative Games
- \(NP\)-hardness of linear multiplicative programming and related problems
Cited in
(2)
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6581973)
