文件名称:c4
介绍说明－－下载内容均来自于网络，请自行研究使用
装箱问题
问题描述：装箱问题可简述如下：设有编号为0、1、…、n-1的n种物品，体积分别为v0、v1、…、vn-1。将这n种物品装到容量都为V的若干箱子里。约定这n种物品的体积均不超过V，即对于0≤i＜n，有0＜vi≤V。不同的装箱方案所需要的箱子数目可能不同。装箱问题要求使装尽这n种物品的箱子数要少-Packing problem Problem Descr iption: Packing problem can be summarized as follows: with numbered 0,1, ..., n-1 n-kind items, the volume was v0, v1, ..., vn-1. These n kinds of goods are loaded to capacity for the V number of the box. Agreed volume of the n kinds of goods does not exceed V, that is, for 0 ≤ i < n, there is 0 < vi ≤ V. Different packing boxes needed to program the number may be different. Packing problem requires the equipment to do these kinds of items n the number of boxes to be less
问题描述：装箱问题可简述如下：设有编号为0、1、…、n-1的n种物品，体积分别为v0、v1、…、vn-1。将这n种物品装到容量都为V的若干箱子里。约定这n种物品的体积均不超过V，即对于0≤i＜n，有0＜vi≤V。不同的装箱方案所需要的箱子数目可能不同。装箱问题要求使装尽这n种物品的箱子数要少-Packing problem Problem Descr iption: Packing problem can be summarized as follows: with numbered 0,1, ..., n-1 n-kind items, the volume was v0, v1, ..., vn-1. These n kinds of goods are loaded to capacity for the V number of the box. Agreed volume of the n kinds of goods does not exceed V, that is, for 0 ≤ i < n, there is 0 < vi ≤ V. Different packing boxes needed to program the number may be different. Packing problem requires the equipment to do these kinds of items n the number of boxes to be less
(系统自动生成,下载前可以参看下载内容)
下载文件列表
c4.txt