Pages that link to "Item:Q1280199"

The following pages link to A reformulation-linearization technique for solving discrete and continuous nonconvex problems (Q1280199):

Displaying 50 items.

• Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
• An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation (Q2044572) (← links)
• Quadratic optimization with switching variables: the convex hull for \(n=2\) (Q2044962) (← links)
• Convexification techniques for linear complementarity constraints (Q2045009) (← links)
• Convex hull representations for bounded products of variables (Q2046306) (← links)
• On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic (Q2046307) (← links)
• Computing in combinatorial optimization (Q2075761) (← links)
• Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere (Q2080815) (← links)
• Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\) (Q2093276) (← links)
• SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs (Q2097634) (← links)
• Probability estimation via policy restrictions, convexification, and approximate sampling (Q2097639) (← links)
• On sample average approximation for two-stage stochastic programs without relatively complete recourse (Q2097656) (← links)
• A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs (Q2118082) (← links)
• On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
• A disjunctive cut strengthening technique for convex MINLP (Q2129197) (← links)
• The probabilistic travelling salesman problem with crowdsourcing (Q2146980) (← links)
• Strategic bidding in price coupled regions (Q2155379) (← links)
• Tightening methods based on nontrivial bounds on bilinear terms (Q2168621) (← links)
• Maximization of a PSD quadratic form and factorization (Q2230781) (← links)
• A new framework to relax composite functions in nonlinear programs (Q2235154) (← links)
• Relax-tighten-round algorithm for optimal placement and control of valves and chlorine boosters in water networks (Q2239916) (← links)
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
• RLT insights into lift-and-project closures (Q2257076) (← links)
• On the problem of packing spheres in a cube (Q2263331) (← links)
• A scalable global optimization algorithm for stochastic nonlinear programs (Q2274886) (← links)
• Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming (Q2274889) (← links)
• Source localization using TDOA and FDOA measurements based on semidefinite programming and reformulation linearization (Q2278987) (← links)
• Linear programming insights into solvable cases of the quadratic assignment problem (Q2339831) (← links)
• Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
• The effect of strengthened linear formulations on improving the lower bounds for the part families with precedence constraints problem (Q2370343) (← links)
• Probabilistic logic with independence (Q2379311) (← links)
• The quadratic three-dimensional assignment problem: exact and approximate solution methods (Q2384611) (← links)
• Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs (Q2386196) (← links)
• Large-scale standard pooling problems with constrained pools and fixed demands (Q2392105) (← links)
• Generalized S-lemma and strong duality in nonconvex quadratic programming (Q2392110) (← links)
• A multi-commodity flow formulation for the generalized pooling problem (Q2392115) (← links)
• Strong formulations for the pooling problem (Q2392127) (← links)
• On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
• A branch and bound algorithm for quantified quadratic programming (Q2397427) (← links)
• A bounded degree SOS hierarchy for polynomial optimization (Q2397758) (← links)
• On subspace properties of the quadratically constrained quadratic program (Q2411152) (← links)
• Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming (Q2423782) (← links)
• Unbounded convex sets for non-convex mixed-integer quadratic programming (Q2436643) (← links)
• A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs (Q2448194) (← links)
• Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs (Q2452371) (← links)
• Extremal problems for convex polygons (Q2460117) (← links)
• Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra (Q2462348) (← links)
• Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming (Q2490333) (← links)
• On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables (Q2502216) (← links)
• The trust region subproblem with non-intersecting linear constraints (Q2515041) (← links)