Electronic Notes in Discrete Mathematics 

TL;DR: FCA explicitly formalises extension and intension of a concept, their mutual relationships, and the fact that increasing intent implies decreasing extent and vice versa, and allows to derive a concept hierarchy from a given dataset.

TL;DR: An Ant Colony algorithm (ACO) is developed for the Capacitated Vehicle Routing Problem (CVRP) based on the metaheuristic technique introduced by Colorni, Dorigo and Maniezzo.

TL;DR: This work is devoted to evaluating the so-called metric dimension of a finite connected graph, i.e., the minimum cardinality of a resolving set, for a number of graph families, as long as to study its behavior with respect to the join and the cartesian product of graphs.

TL;DR: A Mixed Integer Linear Programming formulation of the problem is proposed assuming that the battery recharging level reached at each station is a decision variable in order to guarantee more flexible routes and a Variable Neighborhood Search Branching is designed for solving the problem at hand in reasonable computational times.

TL;DR: An apparatus is described for use in asbestos removal from an enclosed space where air is drawn into the collector pan and delivered to the trap with the asbestos fibers being at least partially trapped by water within the cylindrical trap.