𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A separation decomposition for orders

✍ Scribed by Thomas Kämpke

Publisher
John Wiley and Sons
Year
1994
Tongue
English
Weight
728 KB
Volume
24
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Several decomposition types of orders and related discrete structures have been investigated so far. In this paper, we present a decomposition for orders based on partial “ignoring” of the order. Structures that are in a certain sense “prime” turn out to be decomposable. The relation to other decomposition methods is analyzed. Bounds for activity networks and reliability functions are obtained. © 1994 by John Wiley & Sons, Inc.

📜 SIMILAR VOLUMES

A Brylawski decomposition for finite ord
A Brylawski decomposition for finite ordered sets
✍ Richard P. Stanley 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 495 KB

Abstmct# A decomposition is given for fini\*.e ordered sets P and is shown to bc a unique decomposition in the sense of Brylawski. Hence there exists a universal invariant g(P) for this decomposition, and we c(Dmpute g(P) explicitly. Some modifications of this decomposition are considered; in partic

New dual-type decomposition algorithm fo
New dual-type decomposition algorithm for nonconvex separable optimization problems
✍ P. Tatjewski 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 776 KB

Although the augmented Lagrange function is not separable, suitable reformulation of this function and introduction of auxiliary variables lead to a decomposition algorithm with simple and efficient adjusting rules for upper level variables.

A Rational Function Decomposition Algori
A Rational Function Decomposition Algorithm by Near-separated Polynomials
✍ Cesar Alonso; Jaime Gutierrez; Tomas Recio 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 585 KB

In this paper we present an algorithm for decomposing rational functions over an arbitrary coefficient field. The algorithm requires exponential time, but is more efficient in practice than the previous ones, including the polynomial time algorithm. Moreover, our algorithm is easier to implement. We