The following pages link to Fast Clustering Algorithms (Q4302716):
Displayed 28 items.
- A three-phased local search approach for the clique partitioning problem (Q306093) (← links)
- A branch-and-bound algorithm for the acyclic partitioning problem (Q336782) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem (Q1048651) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- Genetic algorithms and tabu search: Hybrids for optimization (Q1342325) (← links)
- TSP ejection chains (Q1363749) (← links)
- Constructing efficient simulated annealing algorithms (Q1364480) (← links)
- Cluster analysis and mathematical programming (Q1365055) (← links)
- Relaxed tours and path ejections for the traveling salesman problem (Q1609913) (← links)
- Reformulated acyclic partitioning for rail-rail containers transshipment (Q1735174) (← links)
- Flight gate scheduling with respect to a reference schedule (Q1761900) (← links)
- Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue (Q1908990) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Some computational issues in cluster analysis with no a priori metric (Q1960467) (← links)
- The biclique partitioning polytope (Q2032987) (← links)
- Lagrangian relaxation and pegging test for the clique partitioning problem (Q2256778) (← links)
- Exact algorithms for the minimum \(s\)-club partitioning problem (Q2329904) (← links)
- Flight gate assignment and recovery strategies with stochastic arrival and departure times (Q2362237) (← links)
- New bounds and constraint propagation techniques for the clique partitioning problem (Q2446845) (← links)
- Clustering of microarray data via clique partitioning (Q2576442) (← links)
- Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering (Q2670543) (← links)
- A New Composite Algorithm for Clustering Problems (Q4344451) (← links)
- The clique partitioning problem: Facets and patching facets (Q4537609) (← links)
- Ejection chain and filter-and-fan methods in combinatorial optimization (Q5899416) (← links)
- Ejection chain and filter-and-fan methods in combinatorial optimization (Q5900890) (← 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)