For a graph G, it is known to be a hard problem to compute the competition number k(G) of the graph G in general. In this paper, we give an explicit formula for the competition nu...
This paper studies the duality gap in the simple plant location problem, and presents general formulas for the gap when certain complementary slackness conditions are satisfied. W...
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. ...
We define a notion of realizability, based on a new assignment of formulas, which does not care for precise witnesses of existential statements, but only for bounds for them. The ...
A call admission control scheme named thinning scheme, which smoothly throttles the admission rates of calls according to their priorities and aims to provide multiple prioritized ...