a compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. directed hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. sets of extrema of birkhoff polyhedra are mapped to tours ...

It was recently found that there are very close connections between the existence of additive spanners (subgraphs where all distances are preserved up to an additive stretch), distance preservers (subgraphs in which demand pairs have their distance preserved exactly), and pairwise spanners (subgraphs in which demand pairs have their distance preserved up to a multiplicative or additive stretch)...

in this paper, the gradual real numbers are considered and the notion of the gradual normed linear space is given. also some topological properties of such spaces are studied, and it is shown that the gradual normed linear space is a locally convex space, in classical sense. so the results in locally convex spaces can be translated in gradual normed linear spaces. finally, we give an examp...

in the linear system ax = b the points x are sometimes constrained to lie in a given subspace s of column space of a. drazin inverse for any singular or nonsingular matrix, exist and is unique. in this paper, the singular consistent or inconsistent constrained linear systems are introduced and the effect of drazin inverse in solving such systems is investigated. constrained linear system arise ...