Cardinality constrained Boolean quadratic polytope

DOI10.1016/S0166-218X(97)00039-5zbMATH Open0898.90092OpenAlexW2051183292MaRDI QIDQ1372737FDOQ1372737

Authors: 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

Recommendations

• A polyhedral approach for a constrained quadratic 0-1 problem
• The bipartite Boolean quadric polytope
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• The equipartition polytope. I: Formulations, dimension and basic facets
• Cardinality constrained combinatorial optimization: complexity and polyhedra

zbMATH Keywords

integer programmingbranch-and-cutNP-hardequipartition problemcardinality constrained Boolean quadratic problem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (16)

• Engineering branch-and-cut algorithms for the equicut problem
• A polyhedral approach for a constrained quadratic 0-1 problem
• On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
• Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1
• The bipartite Boolean quadric polytope
• A Lagrangian relaxation approach to the edge-weighted clique problem
• The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints
• Fast heuristics and approximation algorithms
• Matroid optimization problems with monotone monomials in the objective
• Solving the maximum edge weight clique problem via unconstrained quadratic programming
• A polyhedral study of the maximum edge subgraph problem
• On cardinality constrained polymatroids
• A new family of facet defining inequalities for the maximum edge-weighted clique problem
• New facets and a branch-and-cut algorithm for the weighted clique problem.
• The Boolean quadric polytope
• Multilinear sets with two monomials and cardinality constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372737)