Commit 4c9106b9 authored by Rubin, Paul's avatar Rubin, Paul
Browse files

Added license and README.

parent f6e9a42e
<!DOCTYPE html>
<html>
<head>
<title>LICENSE</title>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
</head>
<body>
<a rel="license" href="http://creativecommons.org/licenses/by/3.0/">
<img alt="Creative Commons License" style="border-width:0"
src="https://i.creativecommons.org/l/by/3.0/88x31.png" />
</a>
<br />
This work is licensed under a
<a rel="license" href="http://creativecommons.org/licenses/by/3.0/">
Creative Commons Attribution 3.0 Unported License
</a>.
</body>
</html>
# Transmitter Clusters
This repository contains a Java program that uses CPLEX to optimize the assignment of transmitters and users to a number of clusters, with the objective of maximizing the sum across users of their experienced service quality. The problem originates with [question](https://or.stackexchange.com/questions/7471/how-to-perform-clustering-of-two-different-sets-of-entities) on OR Stack Exchange. A key aspect of the problem is that users are always assigned to the cluster containing the transmitter with highest service weight for the, so the problem really is to cluster the transmitters. (Users must be included in the model because the objective value is determined by a function of their service experience.)
The Java code is self-contained (other than requiring the user to have CPLEX installed and on the library path). It contains two heuristics (one to construct an initial solution, the other to improve the solution) and two mixed-integer programming (MIP) models, the first of which appears to outperform the second significantly. Details of the heuristics and models are contained in a blog post.
\ No newline at end of file
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment