Pages that link to "Item:Q1372737"
From MaRDI portal
The following pages link to Cardinality constrained Boolean quadratic polytope (Q1372737):
Displaying 16 items.
- Solving the maximum edge weight clique problem via unconstrained quadratic programming (Q877032) (← links)
- New facets and a branch-and-cut algorithm for the weighted clique problem. (Q1420411) (← links)
- Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
- Multilinear sets with two monomials and cardinality constraints (Q2097167) (← links)
- A new family of facet defining inequalities for the maximum edge-weighted clique problem (Q2361127) (← links)
- A polyhedral approach for a constrained quadratic 0-1 problem (Q2387431) (← links)
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
- The bipartite Boolean quadric polytope (Q2673249) (← links)
- Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)
- On cardinality constrained polymatroids (Q2861524) (← links)
- The Boolean Quadric Polytope (Q5050144) (← links)
- Fast Heuristics and Approximation Algorithms (Q5050148) (← links)
- Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1 (Q5479831) (← links)
- A polyhedral study of the maximum edge subgraph problem (Q5916096) (← links)
- A Lagrangian relaxation approach to the edge-weighted clique problem (Q5937353) (← links)
- The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints (Q6060149) (← links)