Pages that link to "Item:Q1892658"
From MaRDI portal
The following pages link to A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope (Q1892658):
Displaying 12 items.
- Surrogate-RLT cuts for zero-one integer programs (Q330260) (← links)
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
- A study of the quadratic semi-assignment polytope (Q1013294) (← links)
- Foundation-penalty cuts for mixed-integer programs. (Q1413909) (← links)
- New facets and a branch-and-cut algorithm for the weighted clique problem. (Q1420411) (← links)
- Volume computation for sparse Boolean quadric relaxations (Q2297660) (← links)
- Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem (Q2333129) (← links)
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
- A note on the Boolean quadric polytope (Q2564624) (← links)
- The bipartite Boolean quadric polytope (Q2673249) (← links)
- A Lagrangian relaxation approach to the edge-weighted clique problem (Q5937353) (← links)
- The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints (Q6060149) (← links)
