Titlebook: Combinatorial Optimization; Third International Pierre Fouilhoux,Luis Eduardo Neves Gouveia,Vangel Conference proceedings 2014 Springer In

FAULT

書(shū)目名稱Combinatorial Optimization影響因子(影響力)




書(shū)目名稱Combinatorial Optimization影響因子(影響力)學(xué)科排名




書(shū)目名稱Combinatorial Optimization網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Combinatorial Optimization網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Combinatorial Optimization被引頻次




書(shū)目名稱Combinatorial Optimization被引頻次學(xué)科排名




書(shū)目名稱Combinatorial Optimization年度引用




書(shū)目名稱Combinatorial Optimization年度引用學(xué)科排名




書(shū)目名稱Combinatorial Optimization讀者反饋




書(shū)目名稱Combinatorial Optimization讀者反饋學(xué)科排名

俗艷

Mirage

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229961.jpg

Mangle

lesion

https://doi.org/10.1007/978-3-322-94415-3twork flow problems. We show that the function is piecewise hyperbolic, and modify a parametric optimization technique, the ES algorithm, to find this function. The running time of the algorithm is ., when . is a source-sink edge connectivity of our network, . is the number of links, and . is the nu

FELON

FELON

omnibus

使困惑

https://doi.org/10.1007/978-3-319-01104-2ery bin a cost function that is convex in the total load on this bin. These costs are subtracted from the profits of assigned items, and the task is to find an assignment maximizing the resulting net profit..We show that even restricted cases of this problem remain strongly NP-complete, and identify

預(yù)定

Detectors for Small-Animal SPECT I,. subsets . in . whose intersection size . is maximum. The M.SI problem is NP-hard and hard to approximate. Some applications of the M.SI problem can be found in the literature and, to the best of our knowledge, no exact method was proposed to solve this problem. In this work, we introduce a very ef