한국경영과학회:학술대회논문집 (Proceedings of the Korean Operations and Management Science Society Conference)
- 한국경영과학회 2008년도 추계학술대회 및 정기총회
- /
- Pages.430-434
- /
- 2008
A comparison of group Steiner tree formulations
초록
The group Steiner tree problem is a generalization of the Steiner tree problem that is defined as follows. Given a weighted graph with a family of subsets of nodes, called groups, the problem is to find a minimum weighted tree that contains at least one node in each group. We present some existing and some new formulations for the problem and compare the relaxations of such formulations.
키워드