Pages that link to "Item:Q2361127"
From MaRDI portal
The following pages link to A new family of facet defining inequalities for the maximum edge-weighted clique problem (Q2361127):
Displaying 6 items.
- A cutting-plane approach to the edge-weighted maximal clique problem (Q1309944) (← links)
- New facets and a branch-and-cut algorithm for the weighted clique problem. (Q1420411) (← links)
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations (Q1569939) (← links)
- 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)