Pages that link to "Item:Q689146"
From MaRDI portal
The following pages link to Concave extensions for nonlinear 0-1 maximization problems (Q689146):
Displaying 29 items.
- Non polyhedral convex envelopes for 1-convex functions (Q312465) (← 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)
- Pseudo-Boolean optimization (Q697569) (← links)
- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation (Q730482) (← links)
- Existence and sum decomposition of vertex polyhedral convex envelopes (Q941026) (← links)
- On decomposability of multilinear sets (Q1659675) (← links)
- Two new reformulation convexification based hierarchies for 0-1 MIPs (Q1748458) (← links)
- A class of valid inequalities for multilinear 0-1 optimization problems (Q1751230) (← links)
- Convex envelopes of bivariate functions through the solution of KKT systems (Q1756774) (← links)
- Convex envelopes for edge-concave functions (Q1780948) (← links)
- Some results on the strength of relaxations of multilinear functions (Q1925788) (← links)
- Explicit convex and concave envelopes through polyhedral subdivisions (Q1949256) (← links)
- Berge-acyclic multilinear 0-1 optimization problems (Q1991264) (← links)
- Multilinear sets with two monomials and cardinality constraints (Q2097167) (← links)
- Graph, clique and facet of Boolean logical polytope (Q2124813) (← links)
- On the impact of running intersection inequalities for globally solving polynomial optimization problems (Q2195679) (← links)
- A technique to derive the analytical form of convex envelopes for some bivariate functions (Q2250092) (← links)
- A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation (Q2274853) (← links)
- Convex hull representations of special monomials of binary variables (Q2311191) (← links)
- Global optimization of nonconvex problems with multilinear intermediates (Q2356333) (← links)
- Error bounds for monomial convexification in polynomial optimization (Q2414910) (← links)
- Balanced matrices (Q2433704) (← 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)
- The Running Intersection Relaxation of the Multilinear Polytope (Q4958553) (← links)
- Optimization of Tree Ensembles (Q5144785) (← links)
- On the strength of recursive McCormick relaxations for binary polynomial optimization (Q6161903) (← links)
- On the complexity of binary polynomial optimization over acyclic hypergraphs (Q6174810) (← links)
