Generalized Network Design Problems

作者: 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.

参考文章(54)
Arie M. C. A. Koster, Frequency assignment : models and algorithms Universiteit Maastricht. ,(1999)
Martine Labbé, Gilbert Laporte, Maximizing user convenience and postal service efficiency in post box location Belgian Journal of Operations Research, Statistics and Computer Science. ,vol. 26, pp. 21- 35 ,(1986)
George L Nemhauser, AHG Rinnooy Kan, MJ Todd, Handbooks in operations research and management science North-Holland , Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co. ,(1989)
Charles E. Noon, James C. Bean, An efficient transformation of the generalized traveling salesman problem Infor. ,vol. 31, pp. 39- 44 ,(1993) , 10.1080/03155986.1993.11732212
Mechthild Stoer, Design of Survivable Networks ,(1992)
Bruce L. Golden, A. Assad, VEHICLE ROUTING: METHODS AND STUDIES STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS ;. ,(1988)
Gabriele Reich, Peter Widmayer, Beyond Steiner's Problem: A VLSI Oriented Generalization workshop on graph theoretic concepts in computer science. ,vol. 411, pp. 196- 210 ,(1989) , 10.1007/3-540-52292-1_14