Pages that link to "Item:Q4697093"

The following pages link to Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions (Q4697093):

Displaying 31 items.

• Lifting and separation procedures for the cut polytope (Q403653) (← links)
• Gap inequalities for non-convex mixed-integer quadratic programs (Q408381) (← links)
• Binary positive semidefinite matrices and associated integer polytopes (Q662294) (← links)
• Pseudo-Boolean optimization (Q697569) (← links)
• Block linear majorants in quadratic 0--1 optimization (Q705499) (← links)
• Solving the maximum edge weight clique problem via unconstrained quadratic programming (Q877032) (← links)
• A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) (← links)
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
• An extended formulation approach to the edge-weighted maximal clique problem (Q1278438) (← links)
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
• Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← 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)
• Some new classes of facets for the equicut polytope (Q1900144) (← links)
• Gap inequalities for the cut polytope (Q1911843) (← links)
• Valid inequalities for quadratic optimisation with domain constraints (Q2234747) (← links)
• A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832) (← links)
• A polyhedral approach for a constrained quadratic 0-1 problem (Q2387431) (← links)
• On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
• Unbounded convex sets for non-convex mixed-integer quadratic programming (Q2436643) (← links)
• Generalised 2-circulant inequalities for the max-cut problem (Q2670485) (← links)
• Binary Positive Semidefinite Matrices and Associated Integer Polytopes (Q3503844) (← links)
• The symmetries of the cut polytope and of some relatives (Q3974968) (← links)
• The Boolean Quadric Polytope (Q5050144) (← links)
• Polynomially Computable Bounds for the Probability of the Union of Events (Q5247622) (← links)
• The cut cone. III: On the role of triangle facets (Q5905548) (← links)
• The cut cone. III: On the role of triangle facets (Q5919846) (← links)
• A Lagrangian relaxation approach to the edge-weighted clique problem (Q5937353) (← links)
• The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints (Q6060149) (← links)
• Optimal design of line replaceable units (Q6150236) (← links)