Generalized network design problems
نویسندگان
چکیده
Network design problems consist of identifying an optimal subgraph of a graph, subject to side constraints. In generalized network design problems, the vertex set is partitioned into clusters and the feasibility conditions are expressed in terms of the clusters. Several applications of generalized network design problems arise in the fields of telecommunications, transportation and biology. The aim of this review article is to formally define generalized network design problems, to study their properties and to provide some applications.
منابع مشابه
A New Approach to Generalized Network Design Problems
The network design problems can be generalized in a natural way by considering a related problem relative to a given partition of the nodes of the graph into node sets (clusters), while the feasibility constraints are expressed in terms of the clusters. Several applications of the generalized network design problems arise in fields of telecommunications, facility and locations, transportation, ...
متن کاملInteger programming models and branch-and-cut approaches to generalized {0,1,2}-survivable network design problems
In this article, we introduce the Generalized [Formula: see text]-Survivable Network Design Problem ([Formula: see text]-GSNDP) which has applications in the design of backbone networks. Different mixed integer linear programming formulations are derived by combining previous results obtained for the related [Formula: see text]-GSNDP and Generalized Network Design Problems. An extensive computa...
متن کاملA Simulated Annealing Algorithm for Unsplittable Capacitated Network Design
The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...
متن کاملFast Approximation Algorithms for the Generalized Survivable Network Design Problem
In a standard f -connectivity network design problem, we are given an undirected graph G = (V,E), a cut-requirement function f : 2 → N, and non-negative costs c(e) for all e ∈ E. We are then asked to find a minimum-cost vector x ∈ N such that x(δ(S)) ≥ f(S) for all S ⊆ V . We focus on the class of such problems where f is a proper function. This encodes many well-studied NP-hard problems such a...
متن کاملMatroids, generalized networks, and electric network synthesis
Matroid theory has been applied to solve problems in generalized assignment, operations research, control theory, network theory, flow theory, generalized flow theory or linear programming, coding theory, and telecommunication network design. The operations of matroid union, matroid partitioning, matroid intersection, and the theorem on the greedy algorithm, Rado’s theorem, and Brualdi’s symmet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 148 شماره
صفحات -
تاریخ انتشار 2003