Cardinality constrained Boolean quadratic polytope

DOI10.1016/S0166-218X(97)00039-5zbMath0898.90092OpenAlexW2051183292MaRDI QIDQ1372737

Anuj Mehrotra

Publication date: 18 November 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

integer programmingNP-hardbranch-and-cutequipartition problemcardinality constrained Boolean quadratic problem

Mathematics Subject Classification ID

Quadratic programming (90C20) Boolean programming (90C09)

Related Items (14)

A new family of facet defining inequalities for the maximum edge-weighted clique problem ⋮ The Boolean Quadric Polytope ⋮ Fast Heuristics and Approximation Algorithms ⋮ 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 ⋮ The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints ⋮ New facets and a branch-and-cut algorithm for the weighted clique problem. ⋮ A Lagrangian relaxation approach to the edge-weighted clique problem ⋮ A polyhedral study of the maximum edge subgraph problem ⋮ Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1 ⋮ Matroid optimization problems with monotone monomials in the objective ⋮ Engineering Branch-and-Cut Algorithms for the Equicut Problem ⋮ Multilinear sets with two monomials and cardinality constraints

Cites Work

• The Boolean quadratic polytope: Some characteristics, facets and relatives
• Min-cut clustering
• On the magnetisation of the ground states in two dimensional Ising spin glasses
• The cut polytope and the Boolean quadric polytope
• Facets of the \(k\)-partition polytope
• The partition problem
• The equipartition polytope. I: Formulations, dimension and basic facets
• The equipartition polytope. II: Valid inequalities and facets
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• The Graph Partitioning Polytope on Series-Parallel and 4-Wheel Free Graphs
• On the cut polytope

This page was built for publication: Cardinality constrained Boolean quadratic polytope