Pages that link to "Item:Q1404396"

The following pages link to Global optimization of multiplicative programs (Q1404396):

Displaying 50 items.

• Theoretical and computational results about optimality-based domain reductions (Q288410) (← links)
• A parametric approach for solving a class of generalized quadratic-transformable rank-two nonconvex programs (Q408205) (← links)
• A branch-and-reduce approach for solving generalized linear multiplicative programming (Q410377) (← links)
• Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience (Q613323) (← links)
• A new linearization method for generalized linear multiplicative programming (Q622153) (← links)
• A branch and reduce approach for solving a class of low rank d.c. programs (Q732158) (← links)
• A global optimization method, QBB, for twice-differentiable nonconvex optimization problem (Q811896) (← links)
• A review of recent advances in global optimization (Q842710) (← links)
• A FPTAS for a class of linear multiplicative problems (Q849090) (← links)
• An outcome-space finite algorithm for solving linear multiplicative programming (Q849749) (← links)
• Linearization method for a class of multiplicative programming with exponent (Q864775) (← links)
• Global optimization of generalized linear fractional programming with nonlinear constraints (Q865505) (← links)
• An efficient algorithm for globally solving generalized linear multiplicative programming (Q899000) (← links)
• A new bound-and-reduce approach of nonconvex quadratic programming problems (Q902837) (← links)
• A new accelerating method for globally solving a class of nonconvex programming problems (Q923946) (← links)
• A convex analysis approach for convex multiplicative programming (Q934807) (← links)
• Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
• An outcome space approach for generalized convex multiplicative programs (Q969745) (← links)
• Nonlinear separation of data via mixed 0-1 integer and linear programming (Q990586) (← links)
• A nonisolated optimal solution of general linear multiplicative programming problems (Q1010262) (← links)
• MILP approach to pattern generation in logical analysis of data (Q1028471) (← links)
• A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (Q1628068) (← links)
• A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints (Q1652440) (← links)
• Strong valid inequalities for Boolean logical pattern generation (Q1675646) (← links)
• Global minimization for generalized polynomial fractional program (Q1718667) (← links)
• A global optimization approach for solving generalized nonlinear multiplicative programming problem (Q1724645) (← links)
• Robust metaheuristic algorithm for redundancy optimization in large-scale complex systems (Q1772975) (← links)
• Decomposition for adjustable robust linear optimization subject to uncertainty polytope (Q1789596) (← links)
• An out space accelerating algorithm for generalized affine multiplicative programs problem (Q1794179) (← links)
• Outer space branch and bound algorithm for solving linear multiplicative programming problems (Q2022174) (← links)
• Underestimation functions for a rank-two partitioning method (Q2026521) (← links)
• Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems (Q2088876) (← links)
• Approximating a linear multiplicative objective in watershed management optimization (Q2098027) (← links)
• Outer approximation algorithms for canonical DC problems (Q2269586) (← links)
• Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints (Q2285918) (← links)
• Global optimization method for linear multiplicative programming (Q2355349) (← links)
• A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming (Q2375741) (← links)
• A method of acceleration for a class of multiplicative programming problems with exponent (Q2378273) (← links)
• Global optimization of a rank-two nonconvex program (Q2379188) (← links)
• Data separation via a finite number of discriminant functions: a global optimization approach (Q2383778) (← links)
• A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems (Q2479840) (← links)
• Global optimization algorithm for a generalized linear multiplicative programming (Q2511121) (← links)
• A branch and bound algorithm for globally solving a class of nonconvex programming problems (Q2518145) (← links)
• A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems (Q2572774) (← links)
• Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization (Q2669645) (← links)
• A mini review on UAV mission planning (Q2691325) (← links)
• Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes (Q2790887) (← links)
• An Outcome Space Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programming Problems (Q2942454) (← links)
• A practicable branch-and-bound algorithm for globally solving linear multiplicative programming (Q2970402) (← links)
• (Q3146104) (← links)