یک روش جدید برای حل مشکل طراحی شبکه ذخیره به طور کامل متصل شده

Based on the concept of the transshipment problem a mixed integer programming model is formulated that achieves contiguity of the selected sites. The model is simpler in concept and to implement than previous exact models and does not require any assumptions about the regular shape of candidate sites. The method easily handles the case where more than one reserve system is required. We illustrate this with an example obtaining the trade-off between the number of contiguous areas and utility. We also illustrate that the important property of compactness can be achieved while maintaining contiguity of selected sites.