Comments
 Two versions of code (V1 and V2) are included as part of the download source code
 Comments on matlab version:
 Assume each network has infinite capacity, but only serves one message at a time
 Cost per time, c, is charged for both processing and queueing time
 Single starting solution: code uses absolute likelihood that the message ends up at each network (which is equal), for example x2 = (1P1)*P2 (xi from code and Pi from pdf)
 Multiple starting solutions: uniform random distribution that sums to p = 1
 Suggest [1000; 3000; 10000; 100000] as budget
 Parallelcomputing version
