The cut polytope and the Boolean quadric polytope
From MaRDI portal
Publication:1825140
DOI10.1016/0012-365X(90)90056-NzbMath0683.90068OpenAlexW2148016452MaRDI QIDQ1825140
Publication date: 1990
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(90)90056-n
Programming involving graphs or networks (90C35) Integer programming (90C10) Quadratic programming (90C20) Combinatorial optimization (90C27) Boolean programming (90C09) Polytopes and polyhedra (52Bxx)
Related Items
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods, Arithmetic, Geometry, and Coding Theory: Homage to Gilles Lachaud, A Polytope for a Product of Real Linear Functions in 0/1 Variables, The Boolean Quadric Polytope, Application of cut polyhedra. I, A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope, Speeding up IP-based algorithms for constrained quadratic 0-1 optimization, Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations, A computational study and survey of methods for the single-row facility layout problem, Semidefinite relaxations of ordering problems, Cardinality constrained Boolean quadratic polytope, Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization, The quadratic knapsack problem -- a survey, A note on the 2-circulant inequalities for the MAX-cut problem, Combining semidefinite and polyhedral relaxations for integer programs, Inductive linearization for binary quadratic programs with linear constraints, The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints, Combinatorial optimization with one quadratic term: spanning trees and forests, Gap inequalities for non-convex mixed-integer quadratic programs, An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem, Crossing Minimization in Storyline Visualization, A polyhedral study of lifted multicuts, Partitioning planar graphs: a fast combinatorial approach for max-cut, A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems, Binary positive semidefinite matrices and associated integer polytopes, The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds, A network approach for specially structured linear programs arising in 0-1 quadratic optimization, Constrained 0-1 quadratic programming: basic approaches and extensions, Quadratic knapsack relaxations using cutting planes and semidefinite programming, Berge-acyclic multilinear 0-1 optimization problems, A class of valid inequalities for multilinear 0-1 optimization problems, Facets for the cut cone. I, Improving spectral bounds for clustering problems by Lagrangian relaxation, Canonical dual approach to solving the maximum cut problem, Pseudo-Boolean optimization, \(k\)-neighborly faces of the Boolean quadric polytopes, Local minima and convergence in low-rank semidefinite programming, The QAP-polytope and the star transformation, An effective branch-and-bound algorithm for convex quadratic integer programming, Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems, Exponential Lower Bounds for Polytopes in Combinatorial Optimization, Semidefinite relaxations for partitioning, assignment and ordering problems, Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts, Global Approaches for Facility Layout and VLSI Floorplanning, Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results, Semidefinite relaxations for partitioning, assignment and ordering problems, Volume computation for sparse Boolean quadric relaxations, A study of the quadratic semi-assignment polytope, An evolutionary heuristic for quadratic 0-1 programming, Pitch, extension complexity, and covering problems, A linearization framework for unconstrained quadratic (0-1) problems, An extended formulation approach to the edge-weighted maximal clique problem, Generalized network design polyhedra, Solving quadratic (0,1)-problems by semidefinite programs and cutting planes, A note on the Boolean quadric polytope, Extended formulations for convex hulls of some bilinear functions, Engineering Branch-and-Cut Algorithms for the Equicut Problem, Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem, A new separation algorithm for the Boolean quadric and cut polytopes, On the separation of split inequalities for non-convex quadratic integer programming, Separating subdivision of bicycle wheel inequalities over cut polytopes, Tight Cycle Relaxations for the Cut Polytope, ``Miniaturized linearizations for quadratic 0/1 problems
Cites Work
