| Article ID: | iaor20003055 |
| Country: | Poland |
| Issue: | 1 |
| Start Page Number: | 71 |
| End Page Number: | 78 |
| Publication Date: | Jan 1996 |
| Journal: | Badania Operacyjne I Decyzje |
| Authors: | Pederzoli Giorgio, Sancho F., George Neville |
| Keywords: | programming: dynamic |
The paper gives an equivalent dynamic programming formulation for the node selection problem defined on a special graph and provides a solution in polynomial time. The node selection problem considered is a reformation for the network version of the m-median model with mutual communication. A numerical illustration dealing with three special cases is included.