用于pvc切割的c＃算法

本文介绍了用于pvc切割的c＃算法的处理方法，对大家解决问题具有一定的参考价值，需要的朋友们下面随着小编来一起学习吧！ 问题描述

我正在尝试制作pvc appi。 我需要任何算法或其他方法来帮助我切割Windows的构建版本。 我的matrial是6米，我需要告诉我如何最好的方法来削减它们以避免失去matrials。 请告诉我任何算法或如何搜索或如何建立这样的想法:) i很糟糕的英语抱歉。

hi i am trying to make pvc appi. and i need any algorithm or somethink else that will help me to make cuting of build matrial for windows. my matrial are 6m and i need to show me how to make best way to cut them at end to not have lose of matrials. pls tell me any algorithm or how to search or how to build somethink like this :) i am bad in english sorry.

推荐答案

那里有很多信息可以找到。不要将搜索限制为pvc，因为算法当然适用于所有类型的材料。看看以下链接。 en.wikipedia/wiki/Greedy_algorithm [ ^ ] en.wikipedia/wiki/Cutting_stock_problem [ ^ ] en.wikipedia/wiki/Bin_packing_problem [ ^ ] 祝你好运！ There is a lot of info to find on this. Don't limit your search specific to pvc because the algorithm should work for all kinds of materials of course. Have a look at the following links. en.wikipedia/wiki/Greedy_algorithm[^] en.wikipedia/wiki/Cutting_stock_problem[^] en.wikipedia/wiki/Bin_packing_problem[^] Good luck!