Pages that link to "Item:Q306093"

The following pages link to A three-phased local search approach for the clique partitioning problem (Q306093):

Displaying 8 items.

• Clustering data that are graph connected (Q1753555) (← links)
• Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping (Q2029286) (← links)
• The biclique partitioning polytope (Q2032987) (← links)
• Neighborhood decomposition-driven variable neighborhood search for capacitated clustering (Q2669483) (← links)
• Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem (Q6080763) (← links)
• Fixed set search applied to the clique partitioning problem (Q6112737) (← links)
• \texttt{CP-Lib}: benchmark instances of the clique partitioning problem (Q6548518) (← links)
• Learning driven three-phase search for the maximum independent union of cliques problem (Q6551156) (← links)