Pages that link to "Item:Q2387431"
From MaRDI portal
The following pages link to A polyhedral approach for a constrained quadratic 0-1 problem (Q2387431):
Displaying 10 items.
- A solvable class of quadratic 0-1 programming (Q1193723) (← links)
- A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem (Q1356513) (← links)
- Cardinality constrained Boolean quadratic polytope (Q1372737) (← links)
- Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem (Q2369979) (← links)
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
- Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302) (← links)
- (Q4397866) (← links)
- The Boolean Quadric Polytope (Q5050144) (← links)
- The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints (Q6060149) (← links)