Two-Connected Networks with Rings of Bounded Cardinality
نویسندگان
چکیده
منابع مشابه
Two-Connected Networks with Rings of Bounded Cardinality
We study the problem of designing at minimum cost a two-connected network such that each edge belongs to a cycle using at most K edges. This problem is a particular case of the two-connected networks with bounded meshes problem studied by Fortz, Labbé and Maffioli [6]. In this paper, we compute a lower bound on the number of edges in a feasible solution, we show that the problem is strongly NP-...
متن کاملStructural Results for Two-connected Networks with Rings of Bounded Cardinality
We study the problem of designing at minimum cost a two-connected network such that each edge belongs to a cycle using at most K edges. This problem is a particular case of the two-connected networks with bounded meshes problem studied by Fortz, Labb e and Maaoli 6]. Structural results for this particular case are presented : we compute a lower bound on the number of edges in a feasible solutio...
متن کاملA tabu search heuristic for the design of two-connected networks with bounded rings
We present a tabu search heuristic for a network design problem which consists in determining at minimum cost a two-connected network such that the shortest cycle to which each edge belongs (a “ring”) does not exceed a given length K. Numerical results are provided for randomly generated graphs and graphs coming from real-world applications.
متن کاملTwo-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a “ring”) to which each edge belongs, does not exceed a given length K. We identify a class of valid inequalities, called cycle inequalities, valid for the problem and show that this inequalities together with the so-called cut inequalities yield an integ...
متن کاملBounded Cardinality and Symmetric Relationships
An entity relationship diagram (ERD) shows the cardinality of each entity in a relationship. In an ERD, minimum cardinalities can be either 0 or 1, and maximum cardinalities can be 1 or infinity. Bounded cardinality occurs when a relationship between entities has cardinality within a specified range. Problems displaying bounded cardinality might include team rosters that must have exactly 5, 9,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2004
ISSN: 0926-6003
DOI: 10.1023/b:coap.0000008649.61438.6b