نتایج جستجو برای: structured packing

تعداد نتایج: 152415  

Journal: :CoRR 2016
Mark Sh. Levin

The paper described a generalized integrated glance to bin packing problems including a brief literature survey and some new problem formulations for the cases of multiset estimates of items. A new systemic viewpoint to bin packing problems is suggested: (a) basic element sets (item set, bin set, item subset assigned to bin), (b) binary relation over the sets: relation over item set as compatib...

2012
James Ostrowski Miguel F. Anjos Anthony Vannelli

The past decade has seen advances in general methods for symmetry breaking in mixed-integer linear programming. These methods are advantageous for general problems with general symmetry groups. Some important classes of MILP problems, such as bin packing and graph coloring, contain highly structured symmetry groups. This observation has motivated the development of problem-specific techniques. ...

The crystal structure of the title Schiff base complex is obtained by single-crystal X-ray diffraction data.The solid state structure determination reveals that the coordination geometry around the copper(II) center istetrahedrally distorted square-planar. The crystal packing shows one dimensional infinite chains which arisesfrom the intermolecular interaction and stabilize the crystal packing.

Journal: :Australasian J. Combinatorics 2008
Dameng Deng Renwang Su

For a given positive integer v with v ≡ 4(mod 6) and v > 4, let CKPD(v) denote a canonical Kirkman packing design of order v. It is proved in this paper that any CKPD(v) can be embedded in a CKPD(u) if u ≡ v ≡ 4 (mod 6), v ≥ 82 and u ≥ 3.5v.

Journal: :Electronic Notes in Discrete Mathematics 2010
Mehdi Serairi Mohamed Haouari

We survey lower bounds for the variant of the two-dimensional bin packing problem where items cannot be rotated. We prove that the dominance relation claimed by Carlier et al.[5] between their lower bounds and those of Boschetti and Mingozzi [1] is not valid. We analyze the performance of lower bounds from the literature and we provide the results of a computational experiment.

2000
Claire Mathieu Michael Mitzenmacher

We prove that Best Fit bin packing has linear waste on the discrete distributionU{j, k} (where items are drawn uniformly from the set {1/k, 2/k, · · · , j/k}) for sufficiently large k when j = αk and 0.66 ≤ α < 2/3. Our results extend to continuous skewed distributions, where items are drawn uniformly on [0, a], for 0.66 ≤ a < 2/3. This implies that the expected asymptotic performance ratio of ...

2005
Artem R. Oganov Michael J. Gillan David Price

The high-pressure phase diagram of SiO2 has been calculated using density-functional perturbation theory. We find that phase transitions of silica do not correspond to any observed seismic discontinuities within the Earth. We analyze the breakdown of close packing occurring in SiO2 above 200 GPa and conclude that it is due to asphericity and deformability of ions, which can generally lead to th...

Journal: :Discrete Applied Mathematics 2002
Lázaro Cánovas Mercedes Landete Alfredo Marín

We introduce new classes of facet-de0ning inequalities for the polytope P associated with the set packing formulation of the simple plant location problem (SPLP) with p plants and d destinations. The inequalities are obtained by identifying subgraphs of the intersection graph G(p; d) of SPLP that are facet-de0ning, and lifting their associated facets if it is necessary. To this end, we 0nd subf...

2006
T. Nakanishi K. Aso T. Takamatsu K. Matsuda M. Nakaiwa S. Hasebe

INTRODUCTION In Japan, Pilot Plant of the HIDiC was built in 2005. It was commercial base scale and already achieved the consecutive distillation for 1000 hours. The energy consumption of the pilot HIDiC was only about 70% of that of a conventional distillation column. The HIDiC can lower reboiler and condenser load by heat exchange between rectifying section and stripping section. Therefore, i...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید