Questions tagged [clustering]
The clustering tag has no usage guidance.
11
questions
5
votes
1answer
104 views
How to partition a graph with optimal number of groups?
I have a graph with $N=12$ nodes. Some nodes may not have any edge between them. every edge has a weight. How to find the optimal partitioning of the graph so that total weight in the system is ...
0
votes
1answer
73 views
How to solve this clustering problem with heuristic or meta-heuristic approach?
I have clustering problem with servers and users. This is different to the one posted in https://math.stackexchange.com/questions/4088441/what-will-be-an-efficient-joint-clustering-solution-to-this-...
4
votes
2answers
136 views
Any Solution for $k$-means with minimum and maximum cluster size constraint?
I am looking for an efficient approach to $k$-means clustering with minimum cluster size constraints. The clusters are non overlapping, so, one point can belong to only one cluster.
$N$ be the number ...
3
votes
1answer
64 views
Clustering problem involving multidepots and customers requiring commodities located exclusively in an specific depot
I'm trying to solve a clustering problem that's similiar to a VRP Pickup and Delivery problem with multiple depots and customers.
Each customer demands a commodity that is exclusively found on one ...
4
votes
3answers
223 views
Clustering points based on a distance matrix
Although I asked this question on stackoverflow to possibly reach a broader audience, I wonder your inputs about this problem. Without giving much research into this, I thought p-center problem ($x_{...
5
votes
2answers
1k views
What are some “clustering” algorithms? (but not the type of clustering you're thinking about)
Given a set of $N$ points $\{x\mid x \in \mathbb{R}^D\}$ for some dimensionality $D$ I want a fast algorithm which will give me all unique subsets which satisfy:
$\|x_{i} - x_{j}\|_{D} \leq M$ (all ...
3
votes
1answer
64 views
What is the difference between min- cut formulation and (bi) partitioning formulation?
I have a min-cut formulation and a bi-partitioning problem.
The two problems focus on finding the minimal cut value separating the two partitions?
So what are really the differences between the ...
2
votes
1answer
84 views
How to design and scale sales territory?
My first naive approach is:
Given N number of salesmen. Cluster an area to be N clusters with almost equal number of clients [1] with some kind of same-size clustering/facility location algorithm
...
4
votes
1answer
96 views
Clustering a large ride-matching problem
Background: We are solving a large scale vehicle to person ride-matching problem. The problem is essentially simple (match every person with a vehicle, if possible), yet the problem size is quite ...
11
votes
1answer
369 views
k-means/k-medoids Clustering Implementation in CPLEX Java
I am trying to model a grouping algorithm as k-means clustering problem, by referring to the general definition as mentioned in Wikipedia.
In my system, I have $N$ nodes that I want to group in $m$ ...
16
votes
3answers
319 views
Customer clustering to solve very large-scale VRPs
I am looking for references that used customer aggregation to solve large-scale Vehicle Routing Problems. By aggregation, I mean clustering the customers together and representing them with one node ...
