Generalized network design problems

Network design problems (NDP) consist of identifying an optimal subgraph of a graph, subject to side constraints. In generalized NDP, the vertex set is partitioned into clusters and the feasibility conditions are expressed in terms of the clusters. Several applications of generalized NDP arise in th...

Full description

Saved in:
Bibliographic Details
Published inEuropean Journal of Operational Research Vol. 148; no. 1; pp. 1 - 13
Main Authors Feremans, Corinne, Labbé, Martine, Laporte, Gilbert
Format Book Review Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.07.2003
Elsevier
Elsevier Sequoia S.A
SeriesEuropean Journal of Operational Research
Subjects
Combinatorial optimization
Computer Science
Graphs
Mathematical models
Network design
Operations Research
Optimization
Studies
Systems design
Combinatorial optimization
Network design
Online AccessGet full text
ISSN0377-2217
1872-6860
DOI10.1016/S0377-2217(02)00404-6

Cover

More Information
Summary:Network design problems (NDP) consist of identifying an optimal subgraph of a graph, subject to side constraints. In generalized NDP, the vertex set is partitioned into clusters and the feasibility conditions are expressed in terms of the clusters. Several applications of generalized NDP arise in the fields of telecommunications, transportation and biology. The aim of this review article is to formally define generalized NDP, to study their properties and to provide some applications.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(02)00404-6