Pages that link to "Item:Q1365055"
From MaRDI portal
The following pages link to Cluster analysis and mathematical programming (Q1365055):
Displaying 50 items.
- A combinatorial approach to assess the separability of clusters (Q263327) (← links)
- A model for clustering data from heterogeneous dissimilarities (Q323236) (← links)
- A mixed integer linear model for clustering with variable selection (Q336929) (← links)
- Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← links)
- Approximate functions in a problem of sets separation (Q346819) (← links)
- Sequential clustering with radius and split criteria (Q351557) (← links)
- Preprocessing for a map sectorization problem by means of mathematical programming (Q490244) (← links)
- Complexity of the cluster deletion problem on subclasses of chordal graphs (Q496003) (← links)
- J-means and I-means for minimum sum-of-squares clustering on networks (Q526420) (← links)
- Polynomial kernels for 3-leaf power graph modification problems (Q602747) (← links)
- Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions (Q609175) (← links)
- An optimising approach to alternative clustering schemes (Q623778) (← links)
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering (Q628745) (← links)
- Variable neighborhood search for harmonic means clustering (Q636511) (← links)
- An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
- Greedy random adaptive memory programming search for the capacitated clustering problem (Q707129) (← links)
- Spectral methods for graph clustering - a survey (Q713095) (← links)
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation (Q853887) (← links)
- The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
- Computational study of large-scale \(p\)-median problems (Q868446) (← links)
- Integer programming models for the \(q\)-mode problem (Q881520) (← links)
- New and efficient DCA based algorithms for minimum sum-of-squares clustering (Q898299) (← links)
- Application of general semi-infinite programming to lapidary cutting problems (Q932204) (← links)
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems (Q936447) (← links)
- Optimal partitioning of a data set based on the \(p\)-median model (Q946677) (← links)
- Simulation and optimization approaches to scenario tree generation (Q953641) (← links)
- Agglomerative hierarchical clustering of continuous variables based on mutual information (Q956926) (← links)
- NP-hardness of Euclidean sum-of-squares clustering (Q1009338) (← links)
- DIVCLUS-T: a monothetic divisive hierarchical clustering method (Q1020864) (← links)
- The MIN PFS problem and piecewise linear model estimation (Q1348259) (← links)
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder) (Q1433467) (← links)
- Formulating logical implications in combinatorial optimisation (Q1598766) (← links)
- A clustering algorithm based on graph connectivity (Q1607070) (← links)
- Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach (Q1652097) (← links)
- Large neighborhood search applied to the software module clustering problem (Q1652543) (← links)
- Visualizing data as objects by DC (difference of convex) optimization (Q1749447) (← links)
- Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction (Q1762010) (← links)
- An aggregation heuristic for large scale p-median problem (Q1762151) (← links)
- A heuristic method for large-scale multi-facility location problems (Q1765537) (← links)
- Candidate groups search for K-harmonic means data clustering (Q1792370) (← links)
- Fuzzy J-means: a new heuristic for fuzzy clustering (Q1860175) (← links)
- Cluster graph modification problems (Q1885821) (← links)
- Clustering to minimize the sum of cluster diameters (Q1887718) (← links)
- Some heuristic methods for solving \(p\)-median problems with a coverage constraint (Q1926741) (← links)
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems (Q2018474) (← links)
- A polynomial algorithm for balanced clustering via graph partitioning (Q2029025) (← links)
- Optimization problems for machine learning: a survey (Q2029894) (← links)
- Cluster deletion on interval graphs and split related graphs (Q2037103) (← links)
- A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering (Q2066643) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
