Encounter
发表于 2025-3-21 16:31:46
书目名称Operations Research and Discrete Analysis影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0702139<br><br> <br><br>书目名称Operations Research and Discrete Analysis影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0702139<br><br> <br><br>书目名称Operations Research and Discrete Analysis网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0702139<br><br> <br><br>书目名称Operations Research and Discrete Analysis网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0702139<br><br> <br><br>书目名称Operations Research and Discrete Analysis被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0702139<br><br> <br><br>书目名称Operations Research and Discrete Analysis被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0702139<br><br> <br><br>书目名称Operations Research and Discrete Analysis年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0702139<br><br> <br><br>书目名称Operations Research and Discrete Analysis年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0702139<br><br> <br><br>书目名称Operations Research and Discrete Analysis读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0702139<br><br> <br><br>书目名称Operations Research and Discrete Analysis读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0702139<br><br> <br><br>
禁令
发表于 2025-3-21 22:42:04
http://reply.papertrans.cn/71/7022/702139/702139_2.png
hematuria
发表于 2025-3-22 01:24:25
http://reply.papertrans.cn/71/7022/702139/702139_3.png
delusion
发表于 2025-3-22 06:28:39
http://reply.papertrans.cn/71/7022/702139/702139_4.png
nonradioactive
发表于 2025-3-22 09:35:01
http://reply.papertrans.cn/71/7022/702139/702139_5.png
Negligible
发表于 2025-3-22 14:03:06
On Schedules of a Single Machine Jobs with Processing Times Nonlinear in Time,problem is NP- hard in the strong sense. The problem remains NP-hard even if we assume that the latest start times are the same for all the jobs, but in this case it can be solved by a pseudopolynomial algorithm.
演绎
发表于 2025-3-22 19:05:19
http://reply.papertrans.cn/71/7022/702139/702139_7.png
头脑冷静
发表于 2025-3-22 21:37:55
The Maximum-Weight Traveling Salesman Problem in Finite-Dimensional Real Spaces, traveling salesman problem. A polynomial algorithm is proposed that solves the problem with any prescribed accuracy for sufficiently large . in finite-dimensional real spaces with a Minkowski metric. The problem is shown to be polynomially solvable in two dimensional polyhedral spaces whose unit ball is a triangle.
神圣将军
发表于 2025-3-23 01:25:42
On a Property of Perfect Binary Codes,It is proved that any perfect binary (., 3)-code is uniquely reconstructible from the allocation of its code vertices in the two medium layers of the .-dimensional unit cube. A nontrivial upper bound is obtained for the number of such codes.
补角
发表于 2025-3-23 07:37:46
http://reply.papertrans.cn/71/7022/702139/702139_10.png