Pages that link to "Item:Q1925788"
From MaRDI portal
The following pages link to Some results on the strength of relaxations of multilinear functions (Q1925788):
Displaying 34 items.
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Generalized decision rule approximations for stochastic programming via liftings (Q494331) (← links)
- Relaxations and discretizations for the pooling problem (Q513173) (← links)
- Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions (Q517317) (← links)
- Extended formulations for convex hulls of some bilinear functions (Q783025) (← links)
- Deriving convex hulls through lifting and projection (Q1646568) (← links)
- Strong formulations for quadratic optimization with M-matrices and indicator variables (Q1650773) (← links)
- On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
- On decomposability of multilinear sets (Q1659675) (← links)
- Convex and concave envelopes: revisited and new perspectives (Q1728297) (← links)
- A class of valid inequalities for multilinear 0-1 optimization problems (Q1751230) (← links)
- A note on solving DiDi's driver-order matching problem (Q1996745) (← links)
- Convex envelopes for ray-concave functions (Q2080818) (← links)
- Exact and approximate results for convex envelopes of special structured functions over simplices (Q2141722) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- A new framework to relax composite functions in nonlinear programs (Q2235154) (← links)
- A branch and bound method for the solution of multiparametric mixed integer linear programming problems (Q2250094) (← links)
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs (Q2274851) (← links)
- New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354) (← links)
- Global optimization of nonconvex problems with multilinear intermediates (Q2356333) (← links)
- Error bounds for monomial convexification in polynomial optimization (Q2414910) (← links)
- Electricity swing option pricing by stochastic bilevel optimization: a survey and new approaches (Q2514869) (← links)
- Piecewise polyhedral formulations for a multilinear term (Q2661606) (← links)
- Perspective Reformulations of the CTA Problem with <i>L</i><sub>2</sub> Distances (Q2931708) (← links)
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
- The Multilinear Polytope for Acyclic Hypergraphs (Q4637506) (← links)
- A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints (Q5108220) (← links)
- On the Composition of Convex Envelopes for Quadrilinear Terms (Q5244679) (← links)
- Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction (Q5348475) (← links)
- Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis (Q5870347) (← links)
- Solving multiplicative programs by binary-encoding the multiplication operation (Q6047881) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- On the strength of recursive McCormick relaxations for binary polynomial optimization (Q6161903) (← links)
- An effective global algorithm for worst-case linear optimization under polyhedral uncertainty (Q6166102) (← links)
