Generalized network design problems

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 in:European Journal of Operational Research 2003-07, Vol.148 (1), p.1-13
Main Authors: Feremans, Corinne, Labbé, Martine, Laporte, Gilbert
Format: Article
Language:eng
Subjects:
Combinatorial optimization
Computer Science
Graphs
Mathematical models
Network design
Operations Research
Optimization
Studies
Systems design
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
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.
ISSN:0377-2217
1872-6860