The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “A branch-and-cut for the Non-Disjoint m-Ring-Star Problem”

Approximation algorithms for the design of SDH/SONET networks

Nadia Brauner, Yves Crama, Gerd Finke, Pierre Lemaire, Christelle Wynants (2003)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this paper, a graph partitioning problem that arises in the design of SONET/SDH networks is defined and formalized. Approximation algorithms with performance guarantees are presented. To solve this problem efficiently in practice, fast greedy algorithms and a tabu-search method are proposed and analyzed by means of an experimental study.

Isomorphism Theorem on Vector Spaces over a Ring

Yuichi Futa, Yasunari Shidama (2017)

Formalized Mathematics

Similarity:

In this article, we formalize in the Mizar system [1, 4] some properties of vector spaces over a ring. We formally prove the first isomorphism theorem of vector spaces over a ring. We also formalize the product space of vector spaces. ℤ-modules are useful for lattice problems such as LLL (Lenstra, Lenstra and Lovász) [5] base reduction algorithm and cryptographic systems [6, 2].

σ-ring and σ-algebra of Sets1

Noboru Endou, Kazuhisa Nakasho, Yasunari Shidama (2015)

Formalized Mathematics

Similarity:

In this article, semiring and semialgebra of sets are formalized so as to construct a measure of a given set in the next step. Although a semiring of sets has already been formalized in [13], that is, strictly speaking, a definition of a quasi semiring of sets suggested in the last few decades [15]. We adopt a classical definition of a semiring of sets here to avoid such a confusion. Ring of sets and algebra of sets have been formalized as non empty preboolean set [23] and field of subsets...