An Efficient Complete Enumeration Method for Network Design Problems and Its Applications

Abstract

In many network design problems, the best layout of components is searched considering construction cost and network reliability. Because of #P-completeness for computation of network reliability, most algorithms for the problems find approximate solutions. In this paper, we propose a complete enumeration method for the network design problems, which… (More)

Topics

10 Figures and Tables

Cite this paper

@inproceedings{Koide2003AnEC, title={An Efficient Complete Enumeration Method for Network Design Problems and Its Applications}, author={Takeshi Koide and S. Shinmori and Hiroaki Ishii}, year={2003} }