超尺寸物品装箱问题及其算法

本文探讨一类新装箱问题-超尺寸物品装箱问题。针对实际解决该问题的两涉法，我们提出了一个评价效率更高的目标函数，证明了在此目标函数下两步法的渐近最坏比不小于2，并给出了渐近量坏比与拆分次数的关系。最后本文提出了一种不同于两步法的新在线算法MA，证明了在新目标函数下其渐近最坏比不超过7/4。     

A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem

We propose in this work a hybrid improvement procedure for the bin packing problem. This heuristic has several features: the use of lower bounding strategies; the generation of initial solutions by reference to the dual min-max problem; the use of load redistribution based on dominance, differencing, and unbalancing; and the inclusion of an improvement process utilizing tabu search. Encouraging results have been obtained for a very wide range of benchmark instances, illustrating the robustness of the algorithm. The hybrid improvement procedure compares favourably with all other heuristics in the literature. It improved the best known solutions for many of the benchmark instances and found the largest number of optimal solutions with respect to the other available approximate algorithms.     

PACKING PAIRS BY QUINTUPLES:THE CASE OF ZERO CONGRUENCE MOD 4

ＰＡＣＫＩＮＧＰＡＩＲＳＢＹＱＵＩＮＴＵＰＬＥＳ：ＴＨＥＣＡＳＥＯＦＺＥＲＯＣＯＮＧＲＵＥＮＣＥＭＯＤ４ＹＩＮＪＩＡＮＸＩＮＧＡｂｓｔｒａｃｔ：ＬｅｔＤ（ｖ）ｄｅｎｏｔｅｔｈｅｍａｘｉｍｕｍｎｕｍｂｅｒｏｆｑｕｉｎｔｕｐｌｅｓｏｆａｖ－ｓｅｔｏｆｐｏ...     

A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms

This paper introduces a novel approach for extracting the maximum number of non-overlapping test forms from a large collection of overlapping test sections assembled from a given item bank. The approach involves solving maximum set packing problems (MSPs). A branch-and-bound MSP algorithm is developed along with techniques adapted from constraint programming to estimate lower and upper bounds on the optimal MSP solution. The algorithm is general and can be applied in other applications including combinatorial auctions. The results of computer simulations and experiments with an operational item bank are presented. An erratum to this article is available at .     

Packing two disks into a polygonal environment

We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are contained in P, and whose radius is maximized. Our main result is a simple randomized algorithm whose expected running time, on any input, is O(nlogn). This is optimal in the algebraic decision tree model of computation.     

关于Zd中离散填充指标的注记

探讨了Z^d中离散填充指标的一些性质，给出了Z^d中离散填充维数的一个等价定义．     

POROSITY CALCULATION OFMIXTURES OF FIBROUS PARTICLES

The initial forming of fiber blend to high green density, i.e. the packing of fibrous particles, is important to the reinforcement of composite materials. It is very useful to develop a general predictive method for the optimum selection of particle mixtures for the property control of ceramic or composite products. This paper presents such a mathematical model developed on the basis of the similarity analysis between the spherical and non-spherical particle packings and assesses its applicability to the packing of fibrous particles with discrete and/or continuous length distributions. The results indicate that the model can predict this packing system well and hence provide an effective way to solve various packing problems in the composite materials processing.     

Synthesis and crystal structures of extremely crowded oligophenylenes as model precursors to ‘cubic graphite’

By using drastic conditions for a Diels-Alder cycloaddition reaction, it was possible to synthesize an oligophenylene with an extremely dense packing of the benzene rings. Crystallographic data could be obtained and a projection of the structure on the plane of the central phenyl ring reveals that the molecule retained its theoretical threefold symmetry with only minor deviations. Due to its dense packing of interlocked benzene rings, this oligophenylene could be furthermore used as a suitable precursor for constructing a subunit of ‘cubic graphite’.     

NUMERICAL ANALYSIS OF QUASICONFORMAL MAPPINGS BY CIRCLE PACKINGS

Thurston proposed that conformal mappings can be approximated by circle packing isomorphisms and the approach can be implemented efficiently. Based on the circle packing methods the rate of convergence of approximating solutions for quasiconformai mappings in the plane is discussed.     

斜角入射沉积法制备渐变折射率薄膜的折射率分析

斜角入射沉积法是一种制备薄膜的新颖方法,它可以用来制备渐变折射率薄膜.本文首先探讨了膜料的沉积入射角为α,薄膜柱状生长倾斜角为β时的薄膜的填充系数;之后利用drude理论,分析研究了斜角入射沉积法制备渐变折射率薄膜的折射率与薄膜的入射角和生长方向的关系. 关键词： 斜角入射沉积 渐变折射率 填充系数