Browsing by Keywords "Combinatorial mathematics"
Now showing items 1-4 of 4
An improved graph-entropy bound for perfect hashing (IEEE, 1994-06-07)Gives an improved graph-entropy bound on the size of families of perfect hash functions. Examples are given illustrating that the new bound improves previous bounds in several instances.
On the single-assignment p-hub center problem (Elsevier, 2000)We study the computational aspects of the single-assignment p-hub center problem on the basis of a basic model and a new model. The new model's performance is substantially better in CPU time than different linearizations ...
Ordinal covering using block designs (IEEE, 2010)A frequently encountered problem in peer review systems is to facilitate pairwise comparisons of a given set of documents by as few experts as possible. In , it was shown that, if each expert is assigned to review k ...
The single-assignment hub covering problem: models and linearizations (Palgrave Macmillan Ltd., 2003)We study the hub covering problem which, so far, has remained one of the unstudied hub location problems in the literature. We give a combinatorial and a new integer programming formulation of the hub covering problem ...