Pages that link to "Item:Q3705237"
From MaRDI portal
The following pages link to Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs (Q3705237):
Displayed 8 items.
- An extended formulation approach to the edge-weighted maximal clique problem (Q1278438) (← links)
- 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)
- A new family of facet defining inequalities for the maximum edge-weighted clique problem (Q2361127) (← links)
- A polyhedral approach for a constrained quadratic 0-1 problem (Q2387431) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- A Lagrangian relaxation approach to the edge-weighted clique problem (Q5937353) (← links)