The valve location problem in simple network topologies

INFORMS Journal on Computing

Volumn 22, Issue 3, 2010, Pages 433-442

  Bodlaender, Hans L ^a   Hendriks, Albert ^a   Grigoriev, Alexander ^b   Grigorieva, Nadejda V ^c  

^a UTRECHT UNIVERSITY   (Netherlands)

^b MAASTRICHT UNIVERSITY   (Netherlands)

^c Institute of Power Resources Transport (IPTER)   (Russian Federation)

Author keywords

Binary search; Bounded treewidth; Computational complexity; Dynamic programming; Valve location problem

Indexed keywords

EID: 77955492031     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1090.0365     Document Type: Article

References (16)

1. Alon, N., P. Seymour, R. Thomas. 1980. A separator theorem for graphs with an excluded minor and its applications. Proc. 22nd Sympos. Theory Comput. (STOC'1980), ACM, New York, 293-299.
2. Barefoot, C. A., R. Entringer, H. C. Swart. 1987a. Integrity of trees and the diameter of a graphs. Congressus Numerantium 58 103-114.
3. Barefoot, C. A., R. Entringer, H. C. Swart. 1987b. Vulnerability in graphs: A comparative survey. J. Combin. Math. Combin. Comput. 1 12-22.
4. Bodlaender, H. L. 1996. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25 1305-1317.
5. Bodlaender, H. L. 1998. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209 (1-2) 1-45.
6. Bodlaender, H. L. 2006. Treewidth: Characterizations, applications, and computations. F. V. Fomin, ed. 32nd Internat. Workshop on Graph-Theoretic Concepts Comput. Sci. (WG'2006) Revised Papers. Lecture Notes in Computer Science, Vol. 4271. Springer-Verlag, Heidelberg, Germany, 1-14.
7. Bodlaender, H. L., A. M. C. A. Koster. 2008. Treewidth computations I. Upper bounds. Technical Report UU-CS-2008-032, Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands.
8. Bouwman, S. 2008. A survey of OR models and techniques for electrical grid companies. Proc. 33rd Conf. Math. Oper. Res., Landelijk Netwerk Mathematische Besliskunde (LNMB), Lunteren, The Netherlands.
9. Feige, U., M. Mahdian. 2006. Finding small balanced separators. Proc. 37th Sympos. Theory Comput. (STOC'2006), ACM, New York, 375-384.
10. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco.
11. Grigoriev, A., N. V. Grigorieva. 2009. The valve location problem: Minimizing environmental damage of a spill in long oil pipelines. Comput. Indust. Engrg. 57 (3) 976-982.
12. Hicks, I. V., A. M. C. A. Koster, E. Kolotoǧlu. 2005. Branch and tree decomposition techniques for discrete optimization. J. C. Smith, ed. TutORials 2005: INFORMS Tutorials in Operations Research Series. INFORMS, Hanover, MD, 1-29.
13. Kloks, T., ed. 1994. Treewidth: Computations and Approximations. Lecture Notes in Computer Science, Vol. 842. Springer-Verlag, Berlin.
14. Kratsch, D., T. Kloks, H. Müller. 1997. Measuring the vulnerability for classes of intersection graphs. Discrete Appl. Math. 77 (3) 259-270.
15. Marx, D. 2004. Parameterized graph separation problems. 1st Internat. Workshop on Parameterized and Exact Comput. (IWPEC'2004). Lecture Notes in Computer Science, Vol. 3162. Springer-Verlag, Heidelberg, Germany, 71-82.
16. Ozger, S., L. W. Mays. 2004. Optimal location of isolation valves: A reliability approach. L. W. Mays, ed. Water Supply Systems Security, Chapter 13. McGraw Hill, New York.