Pages that link to "Item:Q1187374"

The following pages link to A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique (Q1187374):

Displaying 46 items.

• Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
• A global optimization algorithm for signomial geometric programming problem (Q1722230) (← links)
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
• An enhanced logarithmic method for signomial programming with discrete variables (Q1752141) (← links)
• Linearization method of global optimization for generalized geometric programming (Q1763283) (← links)
• A new two-level linear relaxed bound method for geometric programming problems (Q1774846) (← links)
• On the posynomial fractional programming problems (Q1848628) (← links)
• Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D (Q1862200) (← links)
• The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal (Q1881682) (← links)
• A relaxation method for nonconvex quadratically constrained quadratic programs (Q1892602) (← links)
• A reformulation-convexification approach for solving nonconvex quadratic programming problems (Q1905961) (← links)
• \(\alpha BB\): A global optimization method for general constrained nonconvex problems (Q1913605) (← links)
• Computation of polytopic invariants for polynomial dynamical systems using linear programming (Q1932703) (← links)
• Branch and cut algorithms for detecting critical nodes in undirected graphs (Q1935569) (← links)
• Optimal egress time calculation and path generation for large evacuation networks (Q1945097) (← links)
• Global minimization using an augmented Lagrangian method with variable lower-level constraints (Q1960193) (← links)
• A new algorithm for concave quadratic programming (Q2010088) (← links)
• Optimal correction of the absolute value equations (Q2022323) (← links)
• Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
• Global optimization of general nonconvex problems with intermediate polynomial substructures (Q2250104) (← links)
• Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
• Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
• A robust algorithm for quadratic optimization under quadratic constraints (Q2385494) (← links)
• A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs (Q2389836) (← links)
• Branch-reduction-bound algorithm for generalized geometric programming (Q2392111) (← links)
• Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications (Q2392765) (← links)
• A global optimization framework for distributed antenna location in CDMA cellular networks (Q2399315) (← links)
• Global optimization of non-convex piecewise linear regression splines (Q2399484) (← links)
• A global optimization using linear relaxation for generalized geometric programming (Q2427180) (← links)
• Inventory and investment in setup and quality operations under return on investment maximization (Q2455619) (← links)
• A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints (Q2459386) (← links)
• Extremal problems for convex polygons (Q2460117) (← links)
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations (Q2476994) (← links)
• Global minimization of rational functions and the nearest GCDs (Q2481368) (← links)
• On the mixed integer signomial programming problems (Q2573603) (← links)
• A global optimization RLT-based approach for solving the hard clustering problem (Q2576449) (← links)
• The eigenvalue complementarity problem (Q2643627) (← links)
• A reformulation-linearization based algorithm for the smallest enclosing circle problem (Q2666744) (← links)
• A reformulation-linearization technique for optimization over simplices (Q2689826) (← links)
• A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem (Q2691902) (← links)
• Second order cone programming relaxation of nonconvex quadratic optimization problems (Q2770189) (← links)
• The second-order cone eigenvalue complementarity problem (Q2811479) (← links)
• Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow (Q6060145) (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)
• Quantifying the benefits of customized vaccination strategies: A network‐based optimization approach (Q6150225) (← links)
• On the strength of recursive McCormick relaxations for binary polynomial optimization (Q6161903) (← links)