KLUEDO RSS FeedKLUEDO Dokumente/documents
https://kluedo.ub.uni-kl.de/index/index/
Sat, 30 Aug 2003 17:30:49 +0200Sat, 30 Aug 2003 17:30:49 +0200Hyperquasivarieties
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1424
We consider the notion of hyper-quasi-identities and hyperquasivarieties, as a common generalization of the concept of quasi-identity and quasivariety invented by A.I. Mal'cev, cf. [10], cf. [5] and hypervariety invented by the authors in [6].Ewa Graczynska; Dietmar Schweigertpreprinthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1424Sat, 30 Aug 2003 17:30:49 +0200Presentation of power-ordered sets
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1259
Power-ordered sets are not always lattices. In the case of distributive lattices we give a description by disjoint of chains. Finite power-ordered sets have a polarity. We introduct the leveled lattices and show examples with trivial tolerance. Finally we give a list of Hasse diagrams of power-ordered sets.Dietmar Schweigertpreprinthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1259Fri, 07 Sep 2001 00:00:00 +0200A reduction algorithm for integer multiple objective linear programs
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/483
We consider a multiple objective linear program (MOLP) max{Cx|Ax = b,x in N_{0}^{n}} where C = (c_ij) is the p x n - matrix of p different objective functions z_i(x) = c_{i1}x_1 + ... + c_{in}x_n , i = 1,...,p and A is the m x n - matrix of a system of m linear equations a_{k1}x_1 + ... + a_{kn}x_n = b_k , k=1,...,m which form the set of constraints of the problem. All coefficients are assumed to be natural numbers or zero. The set M of admissable solutions {hat x} is an admissible solution such that there exists no other admissable solution x' with C{hat x} Cx'. The efficient solutions play the role of optimal solutions for the MOLP and it is our aim to determine the set of all efficient solutionsDietmar Schweigert; Peter Neumayerpreprinthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/483Mon, 03 Apr 2000 00:00:00 +0200Minimal paths on ordered graphs
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/497
To present the decision maker's (DM) preferences in multicriteria decision problems as a partially ordered set is an effective method to catch the DM's purpose and avoid misleading results. Since our paper is focused on minimal path problems, we regard the ordered set of edges (E,=). Minimal paths are defined in repect to power-ordered sets which provides an essential tool to solve such problems. An algorithm to detect minimal paths on a multicriteria minimal path problem is presentedUlrike Bossong; Dietmar Schweigertpreprinthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/497Mon, 03 Apr 2000 00:00:00 +0200Clones preserving a quasi-order
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/830
It is proved that if a finite non-trivial quasi-order is nota linear order then there exist continuum many clones, whichconsist of functions preserving the quasi-order and containall unary functions with this property. It is shown that, fora linear order on a three-element set, there are only 7 suchclonesAndrei A. Krokhin; Dietmar Schweigertpreprinthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/830Mon, 03 Apr 2000 00:00:00 +0200Locally Maximal Clones II
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/842
Ivo Rosenberg; Dietmar Schweigertpreprinthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/842Mon, 07 Feb 2000 00:00:00 +0100