OPUS 4 Latest Documents RSS FeedLatest documents
http://opus4.kobv.de/opus4-ubbayreuth/index/index/
Tue, 15 Apr 2008 11:09:47 +0200Tue, 15 Apr 2008 11:09:47 +0200Bounds for the minimum oriented diameter
http://opus4.kobv.de/opus4-ubbayreuth/frontdoor/index/index/docId/378
We consider the problem of finding an orientation with minimum diameter of a connected bridgeless graph. Fomin et. al. discovered a relation between the minimum oriented diameter an the size of a minimal dominating set. We improve their upper bound.Sascha Kurz; Martin Lätschpreprinthttp://opus4.kobv.de/opus4-ubbayreuth/frontdoor/index/index/docId/378Tue, 15 Apr 2008 11:09:47 +0200The Top-Dog Index: A New Measurement for the Demand Consistency of the Size Distribution in Pre-Pack Orders for a Fashion Discounter with Many Small Branches
http://opus4.kobv.de/opus4-ubbayreuth/frontdoor/index/index/docId/374
We propose the new Top-Dog-Index, a measure for the branch-dependent historic deviation of the supply data of apparel sizes from the sales data of a fashion discounter. A common approach is to estimate demand for sizes directly from the sales data. This approach may yield information for the demand for sizes if aggregated over all branches and products. However, as we will show in a real-world business case, this direct approach is in general not capable to provide information about each branchs individual demand for sizes: the supply per branch is so small that either the number of sales is statistically too small for a good estimate (early measurement) or there will be too much unsatisfied demand neglected in the sales data (late measurement). Moreover, in our real-world data we could not verify any of the demand distribution assumptions suggested in the literature. Our approach cannot estimate the demand for sizes directly. It can, however, individually measure for each branch the scarcest and the amplest sizes, aggregated over all products. This measurement can iteratively be used to adapt the size distributions in the pre-pack orders for the future. A real-world blind study shows the potential of this distribution free heuristic optimization approach: The gross yield measured in percent of gross value was almost one percentage point higher in the test-group branches than in the control-group branches.Sascha Kurz; Jörg Rambau; Jörg Schlüchtermann; Rainer Wolfpreprinthttp://opus4.kobv.de/opus4-ubbayreuth/frontdoor/index/index/docId/374Tue, 15 Apr 2008 10:59:29 +0200Maximal integral point sets over Z^2
http://opus4.kobv.de/opus4-ubbayreuth/frontdoor/index/index/docId/369
Geometrical objects with integral side lengths have fascinated mathematicians through the ages. We call a set P={p(1),...,p(n)} in Z^2 a maximal integral point set over Z^2 if all pairwise distances are integral and every additional point p(n+1) destroys this property. Here we consider such sets for a given cardinality and with minimum possible diameter. We determine some exact values via exhaustive search and give several constructions for arbitrary cardinalities. Since we cannot guarantee the maximality in these cases we describe an algorithm to prove or disprove the maximality of a given integral point set. We additionally consider restrictions as no three points on a line and no four points on a circle.Sascha Kurz; Andrey Radoslavov Antonovpreprinthttp://opus4.kobv.de/opus4-ubbayreuth/frontdoor/index/index/docId/369Tue, 15 Apr 2008 10:45:28 +0200