Titlebook: Combinatorial Optimization; Theory and Algorithm Bernhard Korte,Jens Vygen Textbook 20022nd edition Springer-Verlag Berlin Heidelberg 2002

黑暗社會

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




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




書目名稱Combinatorial Optimization網(wǎng)絡公開度




書目名稱Combinatorial Optimization網(wǎng)絡公開度學科排名




書目名稱Combinatorial Optimization被引頻次




書目名稱Combinatorial Optimization被引頻次學科排名




書目名稱Combinatorial Optimization年度引用




書目名稱Combinatorial Optimization年度引用學科排名




書目名稱Combinatorial Optimization讀者反饋




書目名稱Combinatorial Optimization讀者反饋學科排名

防止

Payment Systems and Employee Policiesapacity .-cut in both cases; see Sections 12.3 and 12.4. This problem, finding a minimum capacity cut δ(.) such that |. ∩ .| is odd for a specified vertex set ., can be solved with network flow techniques.

大方不好

,-Matchings and ,-Joins,apacity .-cut in both cases; see Sections 12.3 and 12.4. This problem, finding a minimum capacity cut δ(.) such that |. ∩ .| is odd for a specified vertex set ., can be solved with network flow techniques.

系列

Textbook 20022nd editionered by the many positive and even enthusiastic comments and letters from colleagues and the gen- eral readership. Several of our colleagues helped us in finding typographical and other errors. In particular, we thank Ulrich Brenner, Andras Frank, Bernd Gartner and Rolf Mohring. Of course, all error

absolve

Help for the Independent Retailer,e consider the problem of minimizing an arbitrary submodular function. This can be done in polynomial time with the .. For the important special case of symmetric submodular functions we mention a simple combinatorial algorithm.

冥想后

冥想后

https://doi.org/10.1007/978-3-662-21711-5Discrete Algorithms; Matching; Matchings; Mathematica; Mathematical Programming; algorithms; approximation

Allergic

任意

Bernhard Korte,Jens VygenWell-written textbook on combinatorial optimization.One of very few textbooks on this topic.Subject area has manifold applications.Includes supplementary material:

相互影響