期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Influence of Process Factors on Electrode Wear Rate when EDM 90CrSi Steel using Graphite Electrodes
1
作者 Tran Huu Danh Le Thi Phuong Thao +2 位作者 Nguyen Thi Quoc Dung Vu Trung Tuyen Luu Anh Tung 《Journal of Environmental Science and Engineering(B)》 2023年第5期230-235,共6页
The findings of a study on the optimization of Electric Discharge Machining(EDM)procedure for processing cylindrically shaped components with graphite electrodes are presented in this paper.Tool steel 90CrSi was the m... The findings of a study on the optimization of Electric Discharge Machining(EDM)procedure for processing cylindrically shaped components with graphite electrodes are presented in this paper.Tool steel 90CrSi was the material of choice for the study’s workpiece.Additionally,the Electrode Wear Rate(EWR)was chosen as the optimization problem’s objective function.An experiment using the Taguchi design was conducted to address this issue.Additionally,experiments were created and their outcomes were analyzed using the Minitab R19 program.The impact of the input process factors on EWR was investigated,including the powder concentration,the pulse on and off times,the servo current,and the servo voltage.Additionally,the best process variables for a minimal EWR were provided. 展开更多
关键词 EDM process factor EWR 90CrSi.
下载PDF
The Continuous Knapsack Problem with Capacities 被引量:1
2
作者 Huynh Duc Quoc Nguyen Chi Tam Tran Hoai Ngoc Nhan 《Journal of the Operations Research Society of China》 EI CSCD 2021年第3期713-721,共9页
We address a variant of the continuous knapsack problem,where capacities regarding costs of items are given into account.We prove that the problem is NP-complete although the classical continuous knapsack problem is s... We address a variant of the continuous knapsack problem,where capacities regarding costs of items are given into account.We prove that the problem is NP-complete although the classical continuous knapsack problem is solvable in linear time.For the case that there exists exactly one capacity for all items,we solve the corresponding problem in O(n log n)time,where n is the number of items. 展开更多
关键词 Knapsack problem COMPLEXITY Capacity Polynomially solvabl
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部