Mathematical modeling of finite topologies
Integer programming is a tool for solving some combinatorial optimization problems. In this paper, we deal with combinatorial optimization problems on finite topologies. We use the binary representation of the sets to characterize finite topologies as the solutions of a Boolean quadratic system. This system is used as a basic model for formulating other types of topologies (e.g. door topology and $T_0$-topology) and some combinatorial optimization problems on finite topologies. As an example of the proposed model, we found that the smallest number $m(k)$ for which the topology exists on an $m(k)$-elements set containing exactly $k$ open sets, for $k = 8$ and $k = 15$ is $3$ and $5$, respectively.