๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Determining an upper bound for a class of rectangular packing problems

โœ Scribed by Kathryn A. Dowsland

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
376 KB
Volume
12
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A best-first branch-and-bound algorithm
A best-first branch-and-bound algorithm for orthogonal rectangular packing problems
โœ Mhand Hifi; Rachid Ouafi ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 294 KB

In this paper we discuss the problem of packing a set of small rectangles (pieces) in an enclosing ยฎnal rectangle. We present ยฎrst a best-ยฎrst branch-and-bound exact algorithm and second a heuristic approach in order to solve exactly and approximately this problem. The performances of the proposed a

Upper Bounds for the Number of Conjugacy
Upper Bounds for the Number of Conjugacy Classes of a Finite Group
โœ Martin W. Liebeck; Lรกszlรณ Pyber ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 315 KB

For a finite group G, let k G denote the number of conjugacy classes of G. We prove that a simple group of Lie type of untwisted rank l over the field of q ลฝ . l elements has at most 6 q conjugacy classes. Using this estimate we show that for ลฝ . ลฝ . 10 n completely reducible subgroups G of GL n, q