The Boolean quadratic polytope: Some characteristics, facets and relatives
From MaRDI portal
Recommendations
Cites work
- A class of facet producing graphs for vertex packing polyhedra
- A new polynomial-time algorithm for linear programming
- A Selection Problem of Shared Fixed Costs and Network Flows
- A solvable case of quadratic 0-1 programming
- Almost integral polyhedra related to certain combinatorial optimization problems
- Application of pseudo-Boolean programming to the theory of graphs
- Characterization of Totally Unimodular Matrices
- Covering, Packing and Knapsack Problems
- Experiments in quadratic 0-1 programming
- Facets of the Bipartite Subgraph Polytope
- Facets of the clique partitioning polytope
- Further facet generating procedures for vertex packing polytopes
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 3152649 (Why is no real title available?)
- scientific article; zbMATH DE number 3751684 (Why is no real title available?)
- scientific article; zbMATH DE number 3619917 (Why is no real title available?)
- scientific article; zbMATH DE number 3332070 (Why is no real title available?)
- scientific article; zbMATH DE number 3333883 (Why is no real title available?)
- scientific article; zbMATH DE number 3361920 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- Lifting the facets of zero–one polytopes
- L’algebre de Boole et ses applications en recherche operationnelle
- Methods of Nonlinear 0-1 Programming
- Minimum cuts and related problems
- Nonlinear 0–1 programming: I. Linearization techniques
- Notes—On a Selection Problem
- On certain polytopes associated with graphs
- On the cut polytope
- On the facial structure of set packing polyhedra
- On the Set-Covering Problem
- On the stable set polytope of a series-parallel graph
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Polytope des independants d'un graphe série-parallèle
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Set Partitioning: A survey
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- Technical Note—A Note on Zero-One Programming
- The ellipsoid method and its consequences in combinatorial optimization
- The equipartition polytope. II: Valid inequalities and facets
- The perfectly matchable subgraph polytope of a bipartite graph
- The quadratic assignment problem
- The travelling salesman problem and a class of polyhedra of diameter two
- Total unimodularity and the Euler-subgraph problem
- Vertex packings: Structural properties and algorithms
Cited in
(only showing first 100 items - show all)- A study of the quadratic semi-assignment polytope
- A linearization framework for unconstrained quadratic (0-1) problems
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- Facets for the cut cone. I
- Optimal design of a distributed network with a two-level hierarchical structure
- Cliques and clustering: A combinatorial approach
- On the Boolean-quadric packing uncapacitated facility-location polytope
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
- An extended formulation approach to the edge-weighted maximal clique problem
- The partial constraint satisfaction problem: Facets and lifting theorems
- Separating subdivision of bicycle wheel inequalities over cut polytopes
- Boolean polynomials and set functions
- Min-cut clustering
- A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem
- The volume of relaxed Boolean-quadric and cut polytopes
- Cardinality constrained Boolean quadratic polytope
- Some thoughts on combinatorial optimisation
- New facets and a branch-and-cut algorithm for the weighted clique problem.
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- Relaxation optical bistability: A new class of optically bistable elements
- Formulating logical implications in combinatorial optimisation
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- Matroid optimisation problems with nested non-linear monomials in the objective function
- Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations
- Graph bisection revisited
- On decomposability of multilinear sets
- Convex and concave envelopes: revisited and new perspectives
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
- On the Lovász theta function and some variants
- Addendum to: ``Vertex adjacencies in the set covering polyhedron
- The generalized vertex cover problem and some variations
- Maximum-entropy sampling and the Boolean quadric polytope
- A polyhedral study of nonconvex quadratic programs with box constraints
- Membership testing for Bernoulli and tail-dependence matrices
- An evolutionary heuristic for quadratic 0-1 programming
- The cut polytope and the Boolean quadric polytope
- Application of cut polyhedra. I
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
- A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
- Facets of the \(k\)-partition polytope
- Refined proximity and sensitivity results in linearly constrained convex separable integer programming
- Graphic vertices of the metric polytope
- Some results on the strength of relaxations of multilinear functions
- On convex relaxations for quadratically constrained quadratic programming
- Separation and relaxation for cones of quadratic forms
- Berge-acyclic multilinear 0-1 optimization problems
- Exact and heuristic algorithms for the weighted total domination problem
- Matroid optimization problems with monotone monomials in the objective
- Exact and heuristic algorithms for the maximum weighted submatrix coverage problem
- Set characterizations and convex extensions for geometric convex-hull proofs
- Multilinear sets with two monomials and cardinality constraints
- Complete positivity and distance-avoiding sets
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
- On tail dependence matrices. The realization problem for parametric families
- On the impact of running intersection inequalities for globally solving polynomial optimization problems
- Exploiting partial correlations in distributionally robust optimization
- Valid inequalities for quadratic optimisation with domain constraints
- A new framework to relax composite functions in nonlinear programs
- \(k\)-neighborly faces of the Boolean quadric polytopes
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
- On a recognition problem on cut polytope relaxations
- Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- Assortment optimization under the multinomial logit model with product synergies
- Volume computation for sparse Boolean quadric relaxations
- Solving multistatic sonar location problems with mixed-integer programming
- Convex hull representations of special monomials of binary variables
- New SOCP relaxation and branching rule for bipartite bilinear programs
- A new separation algorithm for the Boolean quadric and cut polytopes
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
- A new family of facet defining inequalities for the maximum edge-weighted clique problem
- A polyhedral approach for a constrained quadratic 0-1 problem
- An application of the Lovász-Schrijver M(K, K) operator to the stable set problem
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- Boolean quadric polytopes are faces of linear ordering polytopes
- A note on the 2-circulant inequalities for the MAX-cut problem
- The symmetric quadratic traveling salesman problem
- Unbounded convex sets for non-convex mixed-integer quadratic programming
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
- A tight lower bound for a special case of quadratic 0-1 programming
- Evaluating the quality of image matrices in blockmodeling
- A note on the Boolean quadric polytope
- A cut-and-branch algorithm for the quadratic knapsack problem
- The bipartite Boolean quadric polytope
- A polyhedral study of lifted multicuts
- Competitive equilibrium always exists for combinatorial auctions with graphical pricing schemes
- Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure
- A polyhedral study of the quadratic traveling salesman problem
- Mixed integer linear programming formulation techniques
- On the diameter of lattice polytopes
- A polytope for a product of real linear functions in 0/1 variables
- scientific article; zbMATH DE number 4131953 (Why is no real title available?)
- Polynomially solvable cases of binary quadratic programs
- Generalized network design polyhedra
- On integer recognition over some Boolean quadric polytope extension
- scientific article; zbMATH DE number 431488 (Why is no real title available?)
- On integer programming with bounded determinants
This page was built for publication: The Boolean quadratic polytope: Some characteristics, facets and relatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122479)
