| Article ID: | iaor20011979 |
| Country: | Netherlands |
| Volume: | 125 |
| Issue: | 3 |
| Start Page Number: | 526 |
| End Page Number: | 534 |
| Publication Date: | Sep 2000 |
| Journal: | European Journal of Operational Research |
| Authors: | Volgenant A., Duin C.W., Marsman S. |
| Keywords: | programming: network |
The Dynamic Predicate Stashing Copy Problem (DPSCP) is a problem about managing an information system in a network of computers. Information is stashed from a server computer to a set of client computers. Each client has specified a maximum lifetime of the information stashed on his computer. The problem is to find a minimum cost refresh policy during a finite period of time. We transform the DPSCP to the well known Steiner Problem in Graphs and we compare this approach with a known solution method.