"""
kcenter.py:  model for solving the k-center problem.

select k facility positions such that the maximum distance
of each vertex in the graph to a facility is minimum
            
Copyright (c) by Joao Pedro PEDROSO and Mikio KUBO, 2012
"""
from gurobipy import *

def kcenter(I,J,c,k):
    """kcenter -- minimize the maximum travel cost from customers to k facilities.
    Parameters:
        - I: set of customers
        - J: set of potential facilities
        - c[i,j]: cost of servicing customer i from facility j
        - k: number of facilities to be used
    Returns a model, ready to be solved.
    """

    model = Model("k-center")
    z = model.addVar(vtype="C", name="z")
    x,y = {},{}
    for j in J:
        y[j] = model.addVar(vtype="B", name="y(%s)"%j)
        for i in I:
            x[i,j] = model.addVar(vtype="B", name="x(%s,%s)"%(i,j))
    model.update()

    for i in I:
        model.addConstr(quicksum(x[i,j] for j in J) == 1, "Assign(%s)"%i)
        
        for j in J:
            model.addConstr(x[i,j] <= y[j], "Strong(%s,%s)"%(i,j))
            model.addConstr(c[i,j]*x[i,j] <= z, "Max_x(%s,%s)"%(i,j))

    model.addConstr(quicksum(y[j] for j in J) == k, "Facilities")              

    model.setObjective(z, GRB.MINIMIZE)
    
    model.update()
    model.__data = x,y
    return model


import math
import random
def distance(x1,y1,x2,y2):
    return math.sqrt((x2-x1)**2 + (y2-y1)**2)


def make_data(n,m,same=True):
    if same == True:
        I = range(n)
        J = range(m)
        x = [random.random() for i in range(max(m,n))]    # positions of the points in the plane
        y = [random.random() for i in range(max(m,n))]
    else:
        I = range(n)
        J = range(n,n+m)
        x = [random.random() for i in range(n+m)]    # positions of the points in the plane
        y = [random.random() for i in range(n+m)]
    c = {}
    for i in I:
        for j in J:
            c[i,j] = distance(x[i],y[i],x[j],y[j])

    return I,J,c,x,y

                
if __name__ == "__main__":
    random.seed(67)
    n = 100
    m = n
    I,J,c,x_pos,y_pos = make_data(n,m,same=True)
    k = 10
    model = kcenter(I,J,c,k)
    model.optimize()
    EPS = 1.e-6
    x,y = model.__data
    edges = [(i,j) for (i,j) in x if x[i,j].X > EPS]
    facilities = [j for j in y if y[j].X > EPS]
    print "Optimal value=",model.ObjVal
    print "Selected facilities:",facilities
    print "Edges:",edges
    print "max c:",max([c[i,j] for (i,j) in edges])

    try: # plot the result using networkx and matplotlib
        import networkx as NX
        import matplotlib.pyplot as P 
        P.clf()
        G = NX.Graph()

        facilities = set(j for j in J if y[j].X > EPS)
        other = set(j for j in J if j not in facilities)
        client = set(i for i in I if i not in facilities and i not in other)
        G.add_nodes_from(facilities)
        G.add_nodes_from(client)
        G.add_nodes_from(other)
        for (i,j) in edges:
            G.add_edge(i,j)

        position = {}
        for i in range(len(x_pos)):
            position[i] = (x_pos[i],y_pos[i])

        NX.draw(G,position,with_labels=False,node_color="w",nodelist=facilities)
        NX.draw(G,position,with_labels=False,node_color="c",nodelist=other,node_size=50)
        NX.draw(G,position,with_labels=False,node_color="g",nodelist=client,node_size=50)
        P.show()
    except ImportError:
        print "install 'networkx' and 'matplotlib' for plotting"