✦ LIBER ✦

Decomposition algorithms for minimal cut problems

✍ Scribed by Suleyman Tufekci

Publisher: John Wiley and Sons
Year: 1981
Tongue: English
Weight: 683 KB
Volume: 28
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800280308

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Space-decomposition minimization method

Space-decomposition minimization method for large-scale minimization problems

✍ Chin-Sung Liu; Ching-Hung Tseng 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 822 KB

This paper introduces a set of new algorithms, called the Space-Decomposition Minimization (SDM) algorithms, that decomposes the minimization problem into subproblems. If the decomposed-space subproblems are not coupled to each other, they can be solved independently with any convergent algorithm; o

Alienor, fractal algorithm for multivari

Alienor, fractal algorithm for multivariable minimization problems

✍ A. Guillez 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 299 KB

Algorithm for finding minimal cut sets i

Algorithm for finding minimal cut sets in a fault tree

✍ Ladislav Rosenberg 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 286 KB

This paper presents several algorithms that have been used in a computer code for fault-tree analysing by the minimal cut sets method. The main algorithm is the more efficient version of the new CARA algorithm, which finds minimal cut sets with an auxiliary dynamical structure. The presented algorit

Non-Monotone Space Decomposition Methods

Non-Monotone Space Decomposition Methods for Minimization Problems

✍ S. Keesmann; W. Mönch 📂 Article 📅 2002 🏛 John Wiley and Sons ⚖ 110 KB 👁 1 views

Space-decomposition multiplier method fo

Space-decomposition multiplier method for constrained minimization problems

✍ Chin-Sung Liu; Ching-Huan Tseng 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 749 KB

ln this paper, a new multiplier method that decomposes variable space into decomposed spaces is introduced. This method allows constrained minimization problems to be decomposed into subproblems. A potential constraint strategy that uses only part of the constraint set in the decomposed-space subpro

Cardinality constrained minimum cut prob

Cardinality constrained minimum cut problems: complexity and algorithms

✍ Maurizio Bruglieri; Francesco Maffioli; Matthias Ehrgott 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 377 KB

In several applications the solutions of combinatorial optimization problems (COP) are required to satisfy an additional cardinality constraint, that is to contain a ÿxed number of elements. So far the family of (COP) with cardinality constraints has been little investigated. The present work tackle