Ensembles ordonnés finis : concepts, résultats, usages
Author
Abstract
Suggested Citation
Download full text from publisher
To our knowledge, this item is not available for download. To find whether it is available, there are three options:1. Check below whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Other versions of this item:
- Nathalie Caspard & Bruno Leclerc & Bernard Monjardet, 2007. "Ensembles ordonnés finis : concepts, résultats, usages," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00197128, HAL.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Bruno Leclerc & Bernard Monjardet, 2010.
"Aggregation and residuation,"
Post-Print
halshs-00504982, HAL.
- Bruno Leclerc & Bernard Monjardet, 2011. "Aggregation and residuation," Post-Print halshs-00659190, HAL.
- Bruno Leclerc & Bernard Monjardet, 2011. "Aggregation and residuation," Documents de travail du Centre d'Economie de la Sorbonne 11085, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
- Bruno Leclerc & Bernard Monjardet, 2010. "Aggregation and residuation," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00504982, HAL.
- Bruno Leclerc & Bernard Monjardet, 2011. "Aggregation and residuation," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00659190, HAL.
- Irène Charon & Olivier Hudry, 2010. "An updated survey on the linear ordering problem for weighted or unweighted tournaments," Annals of Operations Research, Springer, vol. 175(1), pages 107-158, March.
- Miguel Couceiro & Michel Grabisch, 2013.
"On the poset of computation rules for nonassociative calculus,"
Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers)
hal-00787750, HAL.
- Miguel Couceiro & Michel Grabisch, 2013. "On the poset of computation rules for nonassociative calculus," PSE-Ecole d'économie de Paris (Postprint) hal-00787750, HAL.
- Miguel Couceiro & Michel Grabisch, 2013. "On the poset of computation rules for nonassociative calculus," Post-Print hal-00787750, HAL.
- Olivier Hudry, 2008. "NP-hardness results for the aggregation of linear orders into median orders," Annals of Operations Research, Springer, vol. 163(1), pages 63-88, October.
More about this item
Keywords
poset; lattice; chain; Galois lattice; hierarchy; discrete mathematics; operational research; data analysis; concept analysis; scheduling; Ordre; treillis; chaîne; dimension; Dilworth; Sperner; Arrow; hiérarchie; mathématiques discrètes; Recherche opérationnelle; Analyse des données; Préférences; Analyse galoisienne des concepts; ordonnancement;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:journl:halshs-00197128. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.