Description: Optimal loading program
Results: 0/discount: 0.8
Try to design a queue-type branch and bound by law search a subset of function space tree. The function of the parameters to determine the feasibility of including the node function and the upper bound of the necessary functions, such as function, this function will be loaded for the solution of the problem.
Loading problem described as follows: a group of n containers were loaded on ships to load ships for the c, of which the weight of the container i was wi. A program to find the optimal load, the ship filled with as much as possible, that is unrestricted in the loading volume of cases, as far as possible, re-fitted shipping container.
Input: the first line there are two positive integers n and c. n is the number of containers, c is the ship s deadweight
1 the next line in a positive integer n, that the weight of the container
Output: the maximum load
For example:
Input:
5 10
72,654
Output:
10
To Search:
- [fjdjf] - branch line with the law to solve severa
- [firstfit] - crates of the first to adapt firstfit me
- [Loading] - With back problems loading method, loadi
- [zuidatuan] - Priority queue using branch and bound me
- [bin] - In the bin-packing problem, there are a
- [zhuangzai] - zhangzai
- [22] - Loading Problem Description and purpose
File list (Check if you may need any files):
最优装载
........\Debug
........\.....\最优装载.exe
........\.....\最优装载.ilk
........\.....\最优装载.pdb
........\最优装载
........\........\Debug
........\........\.....\BuildLog.htm
........\........\.....\mt.dep
........\........\.....\vc90.idb
........\........\.....\vc90.pdb
........\........\.....\最优装载.exe.intermediate.manifest
........\........\.....\最优装载.obj
........\........\最优装载.cpp
........\........\最优装载.vcproj
........\........\最优装载.vcproj.CJTC1989-PC.caojun.user
........\最优装载.ncb
........\最优装载.sln
Download