1) Congruent circles packing problem
等圆Packing问题
2) circle packing problem
圆形packing问题
1.
To solve the circle packing problem that encounters in the field of transportation of freight, a heuristic algorithm is proposed for finding a good arrangement of multiple different-sized circles within a larger rectangular container.
求解具有NP难度的圆形packing问题具有很高的理论与实用价值。
3) packing problem
packing问题
1.
The triangles packing problem is NP-hard.
三角形Packing问题是NP难的,其完整算法的时间复杂度是指数型的。
2.
Inspired by an old adage "gold corner, silver side and strawy void", the idea is improved with "diamond cave" and a new quasi-human algorithm is proposed for solving a typical NP-hard problem, the famous cuboids packing problem.
对典型的NP难度问题——著名的长方体Packing问题,通过观察体会人类几千年来在砌石头下围棋等活动中形成的经验和智慧,受到谚语"金角银边草肚皮"的启发,并将它发展提高到"价值最高钻石穴",提出了一种最大穴度的占角动作优先处理的拟人算法。
3.
The arranging and scheduling of lock chambers is described with a mathematical model of tow-dimension Packing problem,which is a typical NP totality problem.
提出一种基于分步降维思想的启发式快速编排算法,该算法把闸室编排二维Packing问题降到一维求解,有效解决三峡-葛洲坝联合调度的计划编排中与闸室编排相耦合的时间表问题。
4) Packing problems
Packing问题
1.
Based on these, many types of packing problems are considered NP complete, and they are divided into three classes according to the topologies of their solution spaces.
本文讨论了离散模型与连续问题的关系以及图灵机的计算能力,在此基础上扩充了问题及 NP完全问题的定义,根据解空间的拓扑结构特点将NP完全的Packing问题分为三类,并对多边形 Packing问题进行了有益的探讨。
5) P_2-packing
P_2-packing问题
1.
3-D matching problem and P_2-packing problem aretypical matching and packing problem respectively.
3-维匹配问题和P_2-packing问题是两个具有代表性的matching和packing问题。
6) Set Packing
Set Packing问题
1.
Research and Application of Measure and Conquer in Set Packing;
加权分治技术在Set Packing问题中的应用与研究
补充资料：dry packing method
分子式：
CAS号：
性质：在经典色谱法中，将不调湿的固定相装入玻璃柱管中，称为干装法。有别于将固定相调湿后装柱的湿装法。干装时，需随装随敲，装紧、装匀。在高效液相色谱法中，粒度大于20μm的易于充填的固定相可用干装法装柱。
CAS号：
性质：在经典色谱法中，将不调湿的固定相装入玻璃柱管中，称为干装法。有别于将固定相调湿后装柱的湿装法。干装时，需随装随敲，装紧、装匀。在高效液相色谱法中，粒度大于20μm的易于充填的固定相可用干装法装柱。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条