Pages that link to "Item:Q2800956"
From MaRDI portal
The following pages link to An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem (Q2800956):
Displaying 8 items.
- A maximum edge-weight clique extraction algorithm based on branch-and-bound (Q783045) (← links)
- Clustered maximum weight clique problem: algorithms and empirical analysis (Q1652358) (← links)
- PUSH: A generalized operator for the maximum vertex weight clique problem (Q1752768) (← links)
- A new upper bound for the maximum weight clique problem (Q1754725) (← links)
- A new branch-and-bound algorithm for the maximum weighted clique problem (Q2002840) (← links)
- Parallelization of a branch-and-bound algorithm for the maximum weight clique problem (Q2234743) (← links)
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem (Q2302299) (← links)
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem (Q2424766) (← links)
