Abstract
In two recent papers, similar multifacility problems on tree networks were studied where facilities are subtrees of the tree. The complexity of the problems was left as open. In this paper, we formulate a general model that includes the above‐cited problems as special cases and give a polynomial algorithm to solve the general model.
| Original language | English |
|---|---|
| Pages (from-to) | 217-230 |
| Number of pages | 14 |
| Journal | Networks |
| Volume | 22 |
| Issue number | 3 |
| DOIs | |
| State | Published - May 1992 |