Calcul des idéaux d'un ordonné fini

DOI10.1051/ro/1991250302651zbMath0733.90038OpenAlexW2525558711MaRDI QIDQ3360658

Jean-Paul Bordat

Publication date: 1991

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105014

zbMATH Keywords

lattice structureideals of a finite poset

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Programming in abstract spaces (90C48) Lattice ideals, congruence relations (06B10) Distributive lattices (06D99)

Related Items (4)

Reachability analysis on distributed executions ⋮ On-line algorithms for orders ⋮ On-line computations of the ideal lattice of posets ⋮ Efficient algorithms on distributive lattices

This page was built for publication: Calcul des idéaux d'un ordonné fini