Pages that link to "Item:Q1122479"
From MaRDI portal
The following pages link to The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479):
Displaying 50 items.
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
- Matroid optimisation problems with nested non-linear monomials in the objective function (Q1646569) (← links)
- Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations (Q1650771) (← links)
- Graph bisection revisited (Q1657405) (← links)
- On decomposability of multilinear sets (Q1659675) (← links)
- Convex and concave envelopes: revisited and new perspectives (Q1728297) (← links)
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs (Q1728372) (← links)
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← links)
- On the Lovász theta function and some variants (Q1751239) (← links)
- Addendum to: ``Vertex adjacencies in the set covering polyhedron'' (Q1752476) (← links)
- The generalized vertex cover problem and some variations (Q1756348) (← links)
- Maximum-entropy sampling and the Boolean quadric polytope (Q1756791) (← links)
- A polyhedral study of nonconvex quadratic programs with box constraints (Q1774169) (← links)
- Membership testing for Bernoulli and tail-dependence matrices (Q1795588) (← links)
- An evolutionary heuristic for quadratic 0-1 programming (Q1809845) (← links)
- The cut polytope and the Boolean quadric polytope (Q1825140) (← links)
- Application of cut polyhedra. I (Q1891019) (← links)
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope (Q1892658) (← links)
- A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming (Q1893147) (← links)
- Facets of the \(k\)-partition polytope (Q1897366) (← links)
- Refined proximity and sensitivity results in linearly constrained convex separable integer programming (Q1899421) (← links)
- Graphic vertices of the metric polytope (Q1916387) (← links)
- Some results on the strength of relaxations of multilinear functions (Q1925788) (← links)
- On convex relaxations for quadratically constrained quadratic programming (Q1925792) (← links)
- Separation and relaxation for cones of quadratic forms (Q1942279) (← links)
- Berge-acyclic multilinear 0-1 optimization problems (Q1991264) (← links)
- Exact and heuristic algorithms for the weighted total domination problem (Q2027027) (← links)
- Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
- Exact and heuristic algorithms for the maximum weighted submatrix coverage problem (Q2076862) (← links)
- Set characterizations and convex extensions for geometric convex-hull proofs (Q2089779) (← links)
- Multilinear sets with two monomials and cardinality constraints (Q2097167) (← links)
- Complete positivity and distance-avoiding sets (Q2118086) (← links)
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (Q2176277) (← links)
- On tail dependence matrices. The realization problem for parametric families (Q2191424) (← links)
- On the impact of running intersection inequalities for globally solving polynomial optimization problems (Q2195679) (← links)
- Exploiting partial correlations in distributionally robust optimization (Q2227536) (← links)
- Valid inequalities for quadratic optimisation with domain constraints (Q2234747) (← links)
- A new framework to relax composite functions in nonlinear programs (Q2235154) (← links)
- \(k\)-neighborly faces of the Boolean quadric polytopes (Q2259296) (← links)
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations (Q2260912) (← links)
- On a recognition problem on cut polytope relaxations (Q2261801) (← links)
- Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem (Q2272297) (← links)
- Theoretical and computational study of several linearisation techniques for binary quadratic problems (Q2288865) (← links)
- Assortment optimization under the multinomial logit model with product synergies (Q2294378) (← links)
- Volume computation for sparse Boolean quadric relaxations (Q2297660) (← links)
- Solving multistatic sonar location problems with mixed-integer programming (Q2303531) (← links)
- Convex hull representations of special monomials of binary variables (Q2311191) (← links)
- New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354) (← links)
- A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832) (← links)
