Pages that link to "Item:Q2489901"
From MaRDI portal
The following pages link to Noising methods for a clique partitioning problem (Q2489901):
Displayed 14 items.
- A three-phased local search approach for the clique partitioning problem (Q306093) (← links)
- Automatic clustering using genetic algorithms (Q648318) (← links)
- A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices (Q658141) (← links)
- A tabu search approach for the minimum sum-of-squares clustering problem (Q1031685) (← links)
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem (Q1048651) (← links)
- Solving the clique partitioning problem as a maximally diverse grouping problem (Q1677299) (← links)
- The biclique partitioning polytope (Q2032987) (← links)
- A branch-and-price procedure for clustering data that are graph connected (Q2060392) (← links)
- Lagrangian relaxation and pegging test for the clique partitioning problem (Q2256778) (← links)
- Self-tuning of the noising methods (Q3646090) (← links)
- Solving Graph Partitioning Problems with Parallel Metaheuristics (Q4609771) (← links)
- The noising methods: A generalization of some metaheuristics (Q5954829) (← 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)