Pages that link to "Item:Q1048651"
From MaRDI portal
The following pages link to Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem (Q1048651):
Displayed 12 items.
- A three-phased local search approach for the clique partitioning problem (Q306093) (← links)
- A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices (Q658141) (← links)
- Solving the clique partitioning problem as a maximally diverse grouping problem (Q1677299) (← links)
- Evaluating balancing on social networks through the efficient solution of correlation clustering problems (Q1688940) (← links)
- The biclique partitioning polytope (Q2032987) (← links)
- Multi-attribute community detection in international trade network (Q2129400) (← links)
- Lagrangian relaxation and pegging test for the clique partitioning problem (Q2256778) (← links)
- Redundant constraints in the standard formulation for the clique partitioning problem (Q2257087) (← links)
- New bounds and constraint propagation techniques for the clique partitioning problem (Q2446845) (← links)
- The Branch and Cut Method for the Clique Partitioning Problem (Q4973260) (← links)
- An efficient heuristic for the \(k\)-partitioning problem (Q6063777) (← links)
- Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem (Q6080763) (← links)