Pages that link to "Item:Q2339832"

The following pages link to A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832):

Displaying 11 items.

• Extended formulations for convex hulls of some bilinear functions (Q783025) (← links)
• Exact and heuristic algorithms for the weighted total domination problem (Q2027027) (← links)
• Exact and heuristic algorithms for the maximum weighted submatrix coverage problem (Q2076862) (← links)
• Volume computation for sparse Boolean quadric relaxations (Q2297660) (← links)
• A note on the 2-circulant inequalities for the MAX-cut problem (Q2417185) (← links)
• Generalised 2-circulant inequalities for the max-cut problem (Q2670485) (← links)
• The Boolean Quadric Polytope (Q5050144) (← links)
• Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization (Q5084606) (← links)
• Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613) (← links)
• The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints (Q6060149) (← links)
• Dendrograms, minimum spanning trees and feature selection (Q6167525) (← links)