搜索资源列表
DynamicPlanning
- 详细讲解了动态规划的算法问题，再通过“装箱问题”等7个程序实例介绍解决动态规划问题的思路和方法。-Gave a detailed algorithm for dynamic programming problems, and through the " bin-packing problem" and other instances of seven procedures introduced to solve the problem of dynamic programmin
zdf
- 三维装箱问题的混合模拟退火算法，解决np-hard问题的基本思路-Three-dimensional bin-packing problem of the hybrid simulated annealing algorithm, np-hard problem to solve the basic ideas
OptaPlanner
- OptaPlanner是一个轻型嵌入式优化的规划引擎，可以解决雇员排班、日程调度、课程表、车间调度等问题。-OptaPlanner is a lightweight, embeddable planning engine that optimizes planning problems. It solves use cases, such as: Employee shift rostering: timetabling nurses, repairmen, ... Agen
ypap105-bin-packing-problem
- 对一维数据问题的优化，仅供参考的代码，通过优化使结果更优(The optimization of one dimensional data problem)
ga
- 这是一个可以完成装箱问题的遗传算法，很容易移植到各个地方。(This is a genetic algorithm that can complete the bin packing problem. It is easy to transplant to various places.)