Pages that link to "Item:Q1652309"

The following pages link to On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309):

Displaying 17 items.

• A maximum edge-weight clique extraction algorithm based on branch-and-bound (Q783045) (← links)
• The maximum clique interdiction problem (Q1735171) (← 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)
• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
• A new branch-and-filter exact algorithm for binary constraint satisfaction problems (Q2077912) (← links)
• The maximum clique problem for permutation Hamming graphs (Q2156387) (← links)
• An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network (Q2159961) (← links)
• SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem (Q2302299) (← 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)
• Solving longest common subsequence problems via a transformation to the maximum clique problem (Q2664444) (← links)
• A branch‐and‐price approach to <i>k</i>‐clustering minimum biclique completion problem (Q4921257) (← links)
• A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765) (← links)
• The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study (Q6125237) (← links)
• CliSAT: a new exact algorithm for hard maximum clique problems (Q6167321) (← links)
• Learning driven three-phase search for the maximum independent union of cliques problem (Q6551156) (← links)