Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
From MaRDI portal
Publication:4697093
DOI10.1287/MOOR.18.1.245zbMath0778.90041DBLPjournals/mor/BorosH93OpenAlexW2008440851WikidataQ59561010 ScholiaQ59561010MaRDI QIDQ4697093
Publication date: 29 June 1993
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.18.1.245
Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Combinatorial optimization (90C27) Boolean programming (90C09)
Related Items (27)
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods ⋮ The Boolean Quadric Polytope ⋮ Application of cut polyhedra. I ⋮ A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope ⋮ Some new classes of facets for the equicut polytope ⋮ A polyhedral approach for a constrained quadratic 0-1 problem ⋮ On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study ⋮ Solving the maximum edge weight clique problem via unconstrained quadratic programming ⋮ Generalised 2-circulant inequalities for the max-cut problem ⋮ The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints ⋮ Lifting and separation procedures for the cut polytope ⋮ Gap inequalities for non-convex mixed-integer quadratic programs ⋮ Optimal design of line replaceable units ⋮ Unbounded convex sets for non-convex mixed-integer quadratic programming ⋮ Binary positive semidefinite matrices and associated integer polytopes ⋮ The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds ⋮ Valid inequalities for quadratic optimisation with domain constraints ⋮ Pseudo-Boolean optimization ⋮ The cut cone. III: On the role of triangle facets ⋮ A Lagrangian relaxation approach to the edge-weighted clique problem ⋮ Block linear majorants in quadratic 0--1 optimization ⋮ The cut cone. III: On the role of triangle facets ⋮ A linearization framework for unconstrained quadratic (0-1) problems ⋮ An extended formulation approach to the edge-weighted maximal clique problem ⋮ Solving quadratic (0,1)-problems by semidefinite programs and cutting planes ⋮ Polynomially Computable Bounds for the Probability of the Union of Events ⋮ A new separation algorithm for the Boolean quadric and cut polytopes
This page was built for publication: Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
