作者: Corinne Feremans , Martine Labbé , Gilbert Laporte
DOI: 10.1016/S0377-2217(02)00404-6
关键词:
摘要: Abstract Network design problems (NDP) consist of identifying an optimal subgraph a graph, subject to side constraints. In generalized NDP, the vertex set is partitioned into clusters and feasibility conditions are expressed in terms clusters. Several applications NDP arise fields telecommunications, transportation biology. The aim this review article formally define study their properties provide some applications.