Pages that link to "Item:Q2002840"
From MaRDI portal
The following pages link to A new branch-and-bound algorithm for the maximum weighted clique problem (Q2002840):
Displaying 16 items.
- A maximum edge-weight clique extraction algorithm based on branch-and-bound (Q783045) (← links)
- A new upper bound for the maximum weight clique problem (Q1754725) (← links)
- Multi-neighborhood tabu search for the maximum weight clique problem (Q1761843) (← links)
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
- Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound (Q2030442) (← links)
- A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072) (← links)
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems (Q2077912) (← links)
- Boosting ant colony optimization via solution prediction and machine learning (Q2147035) (← links)
- A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs (Q2423295) (← links)
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem (Q2424766) (← links)
- A new trust region technique for the maximum weight clique problem (Q2433799) (← links)
- An exact algorithm based on MaxSAT reasoning for the maximum weight clique problem (Q2800956) (← links)
- Resolution Branch and Bound and an Application: The Maximum Weighted Stable Set Problem (Q3392126) (← links)
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765) (← links)
- A New Branch and Bound Algorithm for the Clique Partitioning Problem (Q5392092) (← links)
- CliSAT: a new exact algorithm for hard maximum clique problems (Q6167321) (← links)
