Pages that link to "Item:Q1122492"
From MaRDI portal
The following pages link to A cutting plane algorithm for a clustering problem (Q1122492):
Displaying 50 items.
- A three-phased local search approach for the clique partitioning problem (Q306093) (← links)
- An extended edge-representative formulation for the \(K\)-partitioning problem (Q325479) (← links)
- Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (Q335322) (← links)
- A branch-and-bound algorithm for the acyclic partitioning problem (Q336782) (← links)
- Divisive heuristic for modularity density maximization (Q342346) (← links)
- Improving heuristics for network modularity maximization using an exact algorithm (Q406498) (← links)
- Orbitopal fixing (Q408377) (← links)
- A randomized PTAS for the minimum consensus clustering with a fixed number of clusters (Q418755) (← links)
- Fitting semiparametric clustering models to dissimilarity data (Q484231) (← links)
- Reformulation of a model for hierarchical divisive graph modularity maximization (Q490216) (← links)
- Branch-and-cut approaches for \(p\)-cluster editing (Q505422) (← links)
- Exact algorithms for cluster editing: Evaluation and experiments (Q534775) (← links)
- Size-constrained graph partitioning polytopes (Q607006) (← links)
- Facets of the clique partitioning polytope (Q752015) (← links)
- Combining clickstream analyses and graph-modeled data clustering for identifying common response processes (Q823870) (← links)
- A simulated annealing based solution approach for the two-layered location registration and paging areas partitioning problem in cellular mobile networks (Q859942) (← links)
- Solving group technology problems via clique partitioning (Q877223) (← links)
- Community detection with the weighted parsimony criterion (Q904925) (← links)
- On the approximation of correlation clustering and consensus clustering (Q931713) (← links)
- Amalgamation of partitions from multiple segmentation bases: a comparison of non-model-based and model-based methods (Q1037693) (← links)
- Going weighted: parameterized algorithms for cluster editing (Q1040589) (← links)
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem (Q1048651) (← links)
- Efficient algorithms for divisive hierarchical clustering with the diameter criterion (Q1176597) (← links)
- A cutting plane algorithm for the windy postman problem (Q1198736) (← links)
- Cliques and clustering: A combinatorial approach (Q1267180) (← links)
- The node capacitated graph partitioning problem: A computational study (Q1290618) (← links)
- A cutting-plane approach to the edge-weighted maximal clique problem (Q1309944) (← links)
- Min-cut clustering (Q1321669) (← links)
- Medians for weight metrics in the covering graphs of semilattices (Q1327234) (← links)
- Cluster analysis and mathematical programming (Q1365055) (← links)
- New facets and a branch-and-cut algorithm for the weighted clique problem. (Q1420411) (← links)
- An exact approach for the balanced \(k\)-way partitioning problem with weight constraints and its application to sports team realignment (Q1631652) (← links)
- Reformulated acyclic partitioning for rail-rail containers transshipment (Q1735174) (← links)
- A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← links)
- Improved compact formulations for a wide class of graph partitioning problems in sparse graphs (Q1751240) (← links)
- Projection results for the \(k\)-partition problem (Q1751250) (← links)
- Clustering data that are graph connected (Q1753555) (← links)
- Consensus of partitions: a constructive approach (Q1761306) (← links)
- Formulations and valid inequalities of the node capacitated graph partitioning problem (Q1814793) (← links)
- A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming (Q1893147) (← links)
- On the partial order polytope of a digraph (Q1915807) (← links)
- Optimal solutions for the double row layout problem (Q1940444) (← links)
- Branch-and-price for \(p\)-cluster editing (Q2013143) (← links)
- Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping (Q2029286) (← links)
- The biclique partitioning polytope (Q2032987) (← links)
- A branch-and-price procedure for clustering data that are graph connected (Q2060392) (← links)
- A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values (Q2095925) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- Multi-attribute community detection in international trade network (Q2129400) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
