Pages that link to "Item:Q2361127"

The following pages link to A new family of facet defining inequalities for the maximum edge-weighted clique problem (Q2361127):

Displayed 3 items.

• Multilinear sets with two monomials and cardinality constraints (Q2097167) ‎ (← links)
• An efficient local search algorithm for solving maximum edge weight clique problem in large graphs (Q2175041) ‎ (← links)
• A cut-and-branch algorithm for the quadratic knapsack problem (Q2673234) ‎ (← links)