Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set ...
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Information and Communication Technologies facilitate the emergence of new contexts and practices of learning that educational institutions have to adapt to their pedagogical disc...
The problem of absolute stability is one of the oldest open problems in the theory of control. Even for the particular case of second-order systems a complete solution was present...