Loading...
Please wait, while we are loading the content...
Similar Documents
Packing under Tolerance Constraints Technische Universit at M Unchen Packing under Tolerance Constraints (preliminary Version)
| Content Provider | Semantic Scholar |
|---|---|
| Author | Tinhofer, Gottfried |
| Copyright Year | 1996 |
| Abstract | Let N = f1; 2; : : : ; ng and c 2 Rn: A k-tuple (t1; : : : ; tk) of elements in N is called an acceptable cell if 1 k Xi=1 cti 1: We consider the problems of (i) nding the set T of all acceptable cells e ciently (ii) nding a maximum number of mutually disjoint acceptable cells. The latter problem is called k-packing under tolerance constraints. For both problems, heuristics and exact solution algorithms are discussed. Finally, we report on rst steps towards the analysis of probabilistic features of packing problems of this kind. 2 |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www-lit.ma.tum.de/veroeff/quel/960.05011.ps.gz |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
