Pages that link to "Item:Q5937353"
From MaRDI portal
The following pages link to A Lagrangian relaxation approach to the edge-weighted clique problem (Q5937353):
Displayed 10 items.
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- Solving the maximum edge weight clique problem via unconstrained quadratic programming (Q877032) (← links)
- New facets and a branch-and-cut algorithm for the weighted clique problem. (Q1420411) (← links)
- Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647) (← links)
- Selecting hierarchical facilities in a service-operations environment (Q1873008) (← 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)
- Dynamic bundle methods (Q2390994) (← links)
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement (Q2471278) (← links)
- Decomposition and dynamic cut generation in integer linear programming (Q2490337) (← links)