Optimization and Realizability Problems for Convex Geometries
Convex geometries are combinatorial structures; they capture in an abstract way the essential features of convexity in Euclidean space, graphs or posets for instance. A convex geometry consists of a finite ground set plus a collection of subsets, called the convex sets and satisfying certain axioms....
Main Author: | |
---|---|
Other Authors: | |
Format: | Doctoral Thesis |
Language: | en |
Published: |
Universite Libre de Bruxelles
2019
|
Subjects: | |
Online Access: | https://dipot.ulb.ac.be/dspace/bitstream/2013/288673/5/ContratDiMerckx.pdf https://dipot.ulb.ac.be/dspace/bitstream/2013/288673/4/TOC.pdf https://dipot.ulb.ac.be/dspace/bitstream/2013/288673/3/main.pdf http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/288673 |