Pages that link to "Item:Q2564608"

The following pages link to \(NP\)-hardness of linear multiplicative programming and related problems (Q2564608):

Displaying 50 items.

• Theoretical and computational results about optimality-based domain reductions (Q288410) (← links)
• An FPTAS for optimizing a class of low-rank functions over a polytope (Q378129) (← links)
• Linear decomposition approach for a class of nonconvex programming problems (Q523884) (← links)
• Approximation of linear fractional-multiplicative problems (Q543418) (← links)
• Convexity conditions of Kantorovich function and related semi-infinite linear matrix inequalities (Q550103) (← links)
• Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms (Q607786) (← links)
• An FPTAS for minimizing the product of two non-negative linear cost functions (Q623370) (← links)
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
• An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem (Q691453) (← links)
• A convexity theorem for multiplicative functions (Q691470) (← links)
• A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
• Regional division and reduction algorithm for minimizing the sum of linear fractional functions (Q824489) (← links)
• A FPTAS for a class of linear multiplicative problems (Q849090) (← links)
• An outcome-space finite algorithm for solving linear multiplicative programming (Q849749) (← links)
• A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem (Q881518) (← links)
• On reoptimizing multi-class classifiers (Q1009262) (← links)
• A nonisolated optimal solution of general linear multiplicative programming problems (Q1010262) (← links)
• Complexity results for some global optimization problems (Q1024247) (← links)
• Minimizing a linear multiplicative-type function under network flow constraints (Q1362518) (← links)
• Multiplicative programming problems: Analysis and efficient point search heuristic (Q1367730) (← links)
• Outcome-space cutting-plane algorithm for linear multiplicative programming (Q1579657) (← links)
• Incorporating monitoring technology and on-site inspections into an \(n\)-person inspection game (Q1634304) (← links)
• Range division and linearization algorithm for a class of linear ratios optimization problems (Q1713180) (← links)
• Global minimization for generalized polynomial fractional program (Q1718667) (← links)
• A global optimization approach for solving generalized nonlinear multiplicative programming problem (Q1724645) (← links)
• New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← 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)
• A practical but rigorous approach to sum-of-ratios optimization in geometric applications (Q1938908) (← links)
• Solving a class of multiplicative programs with 0-1 knapsack constraints (Q1969464) (← links)
• Efficient local search procedures for quadratic fractional programming problems (Q1986108) (← links)
• An efficient global optimization algorithm for maximizing the sum of two generalized Rayleigh quotients (Q1993432) (← links)
• A deterministic method for solving the sum of linear ratios problem (Q2004237) (← links)
• Outer space branch and bound algorithm for solving linear multiplicative programming problems (Q2022174) (← links)
• Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection (Q2097485) (← links)
• An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems (Q2116605) (← links)
• Global algorithm for solving linear multiplicative programming problems (Q2174910) (← links)
• Globally minimizing the sum of a convex-concave fraction and a convex function based on wave-curve bounds (Q2176280) (← links)
• A survey of hidden convex optimization (Q2176821) (← links)
• On the complexity and approximation of the maximum expected value all-or-nothing subset (Q2192058) (← links)
• An effective computational algorithm for the global solution of a class of linear fractional programming (Q2214840) (← links)
• An outcome space algorithm for minimizing a class of linear ratio optimization problems (Q2245774) (← links)
• An objective space cut and bound algorithm for convex multiplicative programmes (Q2250114) (← links)
• Global optimization method for linear multiplicative programming (Q2355349) (← links)
• Solving a class of generalized fractional programming problems using the feasibility of linear programs (Q2360402) (← links)
• A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming (Q2375741) (← links)
• Data separation via a finite number of discriminant functions: a global optimization approach (Q2383778) (← links)
• Minimizing the sum of linear fractional functions over the cone of positive semidefinite matrices: approximation and applications (Q2417051) (← links)
• Perron vector optimization applied to search engines (Q2448379) (← links)
• A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension (Q2450672) (← links)