What
[more]
Solving Steiner Tree Problem as a MILP
Consider a network \(G(V,E)\), with \(W_0 \subset V\) is a set of focus vertices. Let’s call \(s\in W_0\) the multicast sender and the rest \(W = W_0 \backslash \{s\}\) the multicast receivers. Given the edges of unit weight, how to find the multicast tree that connects \(s\) to \(W\) with...
[more]
MathProg language by example
Resources:
WikiBooks on GLPK
IBM DeveloperWorks article on GLPK,
and its part 2
and part 3
[more]
Xi & Chao (2007) ESCAP: Efficient SCan for Alternate Paths to Achieve IP Fast Rerouting (Globecom)
Similar paper:
[more]
The correct way of doing probability
Reading an article from DataGenetics, which shows how people flawed when dealing with probability.
[more]