메뉴 건너뛰기




Volumn 1, Issue , 2010, Pages 291-294

Robust Sensor Placement Problem in municipal water networks

Author keywords

Absolute robustness; Scenario; Sensor Placement Problem; Tabu search; Uncertain

Indexed keywords

ABSOLUTE ROBUSTNESS; CLASSICAL METHODS; COMPUTATIONAL EXPERIMENT; CONTAMINATION SOURCES; MIXED-INTEGER PROGRAMS; MUNICIPAL WATER NETWORKS; ROBUST SENSOR; ROBUSTNESS CRITERION; SCENARIO; SENSOR PLACEMENT PROBLEM; TABU SEARCH HEURISTIC; UNCERTAIN;

EID: 77956428043     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSO.2010.166     Document Type: Conference Paper
Times cited : (7)

References (10)
  • 2
    • 54249098640 scopus 로고    scopus 로고
    • Efficient sensor placement optimization for securing large water distribution networks
    • Nov.
    • A. Krause, et al, "Efficient Sensor Placement Optimization for Securing Large Water Distribution Networks," Journal of Water Resources Planning and Management, vol.134, Nov. 2008, pp. 516-526.
    • (2008) Journal of Water Resources Planning and Management , vol.134 , pp. 516-526
    • Krause, A.1
  • 4
    • 54249118625 scopus 로고    scopus 로고
    • The battle of the water sensor networks (BWSN): A design challenge for engineers and algorithms
    • Nov.
    • A. Ostfeld, et al, "The Battle of the Water Sensor Networks (BWSN): A Design Challenge for Engineers and Algorithms," Journal of Water Resources Planning and Management, vol.134, Nov. 2008, pp. 556- 568.
    • (2008) Journal of Water Resources Planning and Management , vol.134 , pp. 556-568
    • Ostfeld, A.1
  • 6
    • 84870613023 scopus 로고    scopus 로고
    • Robust discrete optimization and network flows
    • May
    • D. Bertimas, and M. Sim, "Robust Discrete Optimization and Network Flows," Mathematical Programming Series B, vol.98, May. 2003, pp. 49-71.
    • (2003) Mathematical Programming Series B , vol.98 , pp. 49-71
    • Bertimas, D.1    Sim, M.2
  • 7
    • 0035425675 scopus 로고    scopus 로고
    • The robust minimum spanning tree problem with interval data
    • Aug.
    • H. Yaman, and O. Karasan, "The Robust Minimum Spanning Tree Problem with Interval Data," Operations Research Letters, vol.29, Aug. 2001, pp. 31-40.
    • (2001) Operations Research Letters , vol.29 , pp. 31-40
    • Yaman, H.1    Karasan, O.2
  • 8
    • 0442266090 scopus 로고    scopus 로고
    • Robust solutions of linear programming problems contaminated with uncertain data
    • Sep.
    • A. Ben-Tal, and A. Nemirovski, "Robust Solutions of Linear Programming Problems Contaminated with Uncertain Data," Mathematical Programming Series A, vol.88, Sep. 2000, pp. 411-424.
    • (2000) Mathematical Programming Series A , vol.88 , pp. 411-424
    • Ben-Tal, A.1    Nemirovski, A.2
  • 9
    • 33644674503 scopus 로고    scopus 로고
    • Robust optimization of contaminant sensor placement for community water systems
    • Jun.
    • R. Carr, et al, "Robust Optimization of Contaminant Sensor Placement for Community Water Systems," Mathematical Programming Series B, vol.107, Jun. 2006, pp. 337-356.
    • (2006) Mathematical Programming Series B , vol.107 , pp. 337-356
    • Carr, R.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.