scientific article

zbMath1238.06001MaRDI QIDQ3116854

Bruno Leclerc, Bernard Monjardet, Nathalie Caspard

Publication date: 13 February 2012

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dualitydistributive latticesGalois connectionalgorithmic complexitysemiorderchainpreferencesDilworth's theoremSperner's theoremfinite ordered setsArrowian theoremsorder coding

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to game theory, economics, and finance (91-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to ordered structures (06-01)

Related Items (28)

Invariant computation in a poset. Convergence to a chain ⋮ Towards Distributivity in FCA for Phylogenetic Data ⋮ Quantified Conjunctive Queries on Partially Ordered Sets ⋮ Dichotomic lattices and local discretization for Galois lattices ⋮ Order quasisymmetric functions distinguish rooted trees ⋮ Games on concept lattices: Shapley value and core ⋮ Aggregation and residuation ⋮ A theoretical look at \textsc{Electre Tri}-nB and related sorting models ⋮ Benchmarking over Distributive Lattices ⋮ Finite dimensional scattered posets ⋮ A Note on Candeal and Induráin’s Semiorder Separability Condition ⋮ On the number of non-dominated points of a multicriteria optimization problem ⋮ Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree. ⋮ Model checking existential logic on partially ordered sets ⋮ Unit representation of semiorders. I: Countable sets ⋮ Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization ⋮ Enumerating and categorizing positive Boolean functions separable by a \(k\)-additive capacity ⋮ \(d\)-complete posets: local structural axioms, properties, and equivalent definitions ⋮ Cuts of poset-valued functions in the framework of residuated maps ⋮ Embedding ordered sets into distributive lattices ⋮ From Meaningful Orderings in the Web of Data to Multi-level Pattern Structures ⋮ A study of algorithms relating distributive lattices, median graphs, and Formal Concept Analysis ⋮ Distributive lattices and Auslander regular algebras ⋮ Bacterial phylogeny in the Cayley graph ⋮ On geometric posets and partial matroids ⋮ Congruences on lattices and lattice-valued functions ⋮ Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding ⋮ Complexity results for extensions of median orders to different types of remoteness

Uses Software

• LOLIB

This page was built for publication: