An algorithm to compute the full set of many-to-many stable matchings.
Ruth MartínezJordi MassóAlejandro NemeJorge OviedoPublished in: Math. Soc. Sci. (2004)
Keyphrases
- k means
- cost function
- detection algorithm
- initial set
- high accuracy
- times faster
- learning algorithm
- improved algorithm
- convex hull
- computational cost
- worst case
- input data
- optimal solution
- nearest neighbour
- matching algorithm
- simulated annealing
- computational complexity
- expectation maximization
- clustering method
- classification algorithm
- linear programming
- experimental evaluation
- dynamic programming
- association rules
- decomposition algorithm
- configuration space
- minimum length