Mixed integer convex programming (MICP) for sensor placement.
Branch and bound for finding the global optimum of the MICP.
Competitive comparison to the battle of the water sensor networks.
Branch and bound algorithm based on convex relaxation and a greedy heuristic.
Implementation capability on real sized water networks.