Titlebook: Operations Research and Discrete Analysis; Alekse? D. Korshunov Book 1997 Springer Science+Business Media Dordrecht 1997 Boolean function.

Encounter

書目名稱Operations Research and Discrete Analysis影響因子(影響力)




書目名稱Operations Research and Discrete Analysis影響因子(影響力)學(xué)科排名




書目名稱Operations Research and Discrete Analysis網(wǎng)絡(luò)公開度




書目名稱Operations Research and Discrete Analysis網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Operations Research and Discrete Analysis被引頻次




書目名稱Operations Research and Discrete Analysis被引頻次學(xué)科排名




書目名稱Operations Research and Discrete Analysis年度引用




書目名稱Operations Research and Discrete Analysis年度引用學(xué)科排名




書目名稱Operations Research and Discrete Analysis讀者反饋




書目名稱Operations Research and Discrete Analysis讀者反饋學(xué)科排名

禁令

hematuria

delusion

nonradioactive

Negligible

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.

演繹

頭腦冷靜

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.

神圣將軍

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.

補(bǔ)角