The densest packing of 12 congruent circles in a circle.
Fodor, Ferenc (2000)
Beiträge zur Algebra und Geometrie
Similarity:
Displaying similar documents to “Universal container for packing rectangles”
The densest packing of 12 congruent circles in a circle.
Packing Parameters in Graphs
I. Sahul Hamid, S. Saravanakumar (2015)
Discussiones Mathematicae Graph Theory
Similarity:
In a graph G = (V,E), a non-empty set S ⊆ V is said to be an open packing set if no two vertices of S have a common neighbour in G. An open packing set which is not a proper subset of any open packing set is called a maximal open packing set. The minimum and maximum cardinalities of a maximal open packing set are respectively called the lower open packing number and the open packing number and are denoted by ρoL and ρo. In this paper, we present some bounds on these parameters. ...
L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing.
Mukhacheva, È.A., Mukhacheva, A.S. (2004)
Journal of Mathematical Sciences (New York)
Similarity:
Notions of denseness.
Kuperberg, Greg (2000)
Geometry & Topology
Similarity:
Dense packings of equal disks in an equilateral triangle: From 22 to 34 and beyond.
Graham, R.L., Lubachevsky, B.D. (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The Densest Packing of Equal Circles into a Parallel Strip.
Z. Füredi (1991)
Discrete & computational geometry
Similarity:
Repeated patterns of dense packings of equal disks in a square.
Graham, R.L., Lubachevski, B.D. (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Densest Packing of Six Equal Circles in a Square.
Hans Melissen (1994)
Elemente der Mathematik
Similarity:
On mixed sphere packings.
Vassallo, Salvatore, Wills, Jörg M. (1994)
Beiträge zur Algebra und Geometrie
Similarity:
What is the minimum length of a non-extendable lace?
Kemnitz, Arnfried, Soltan, Valeriu (1999)
Beiträge zur Algebra und Geometrie
Similarity:
Lattice packings with gap defects are not completely saturated.
Kuperberg, Greg, Kuperberg, Krystyna, Kuperberg, Włodzimierz (2004)
Beiträge zur Algebra und Geometrie
Similarity:
Improving dense packings of equal disks in a square.
Boll, W.David, Donovan, Jerry, Graham, Ronald L., Lubachevsky, Boris D. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A short note on Seshadri constants and packing constants
Halszka Tutaj-Gasińska (2012)
Annales Polonici Mathematici
Similarity:
The note is about a connection between Seshadri constants and packing constants and presents another proof of Lazarsfeld's result from [Math. Res. Lett. 3 (1996), 439-447].
Algorithms for the two dimensional bin packing problem with partial conflicts
Khaoula Hamdi-Dhaoui, Nacima Labadie, Alice Yalaoui (2012)
RAIRO - Operations Research
Similarity:
The two-dimensional bin packing problem is a well-known problem for which several exact and approximation methods were proposed. In real life applications, such as in Hazardous Material transportation, transported items may be partially incompatible, and have to be separated by a safety distance. This complication has not yet been considered in the literature. This paper introduces this extension called the two-dimensional bin packing problem with partial conflicts (2BPPC) which is a...