Polyhedral results for two-connected networks with bounded rings

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

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...

متن کامل

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.

متن کامل

Completeness results for metrized rings and lattices

The Boolean ring $B$ of measurable subsets of the unit interval, modulo sets of measure zero, has proper radical ideals (for example, ${0})$ that are closed under the natural metric, but has no prime ideal closed under that metric; hence closed radical ideals are not, in general, intersections of closed prime ideals. Moreover, $B$ is known to be complete in its metric. Togethe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Programming

سال: 2002

ISSN: 0025-5610,1436-4646

DOI: 10.1007/s10107-002-0299-9