New formulation and optimization methods for water sensor placement
详细信息    查看全文
文摘

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.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700