Pages that link to "Item:Q1569939"
From MaRDI portal
The following pages link to The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations (Q1569939):
Displayed 8 items.
- Solving the maximum edge weight clique problem via unconstrained quadratic programming (Q877032) (← links)
- Approximating the maximum vertex/edge weighted clique using local search (Q1009183) (← links)
- New facets and a branch-and-cut algorithm for the weighted clique problem. (Q1420411) (← links)
- The effect of strengthened linear formulations on improving the lower bounds for the part families with precedence constraints problem (Q2370343) (← links)
- Iterated tabu search for the maximum diversity problem (Q2381330) (← links)
- Disconnecting graphs by removing vertices: a polyhedral approach (Q5422013) (← links)
- A note on characterizing canonical cuts using geometry (Q5449873) (← links)
- A Lagrangian relaxation approach to the edge-weighted clique problem (Q5937353) (← links)