找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復制鏈接]
查看: 32563|回復: 58
樓主
發(fā)表于 2025-3-21 16:25:16 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Combinatorial Optimization
副標題Theory and Algorithm
編輯Bernhard Korte,Jens Vygen
視頻videohttp://file.papertrans.cn/230/229947/229947.mp4
概述Well-written textbook on combinatorial optimization.One of very few textbooks on this topic.Subject area has manifold applications.Includes supplementary material:
叢書名稱Algorithms and Combinatorics
圖書封面Titlebook: Combinatorial Optimization; Theory and Algorithm Bernhard Korte,Jens Vygen Textbook 20022nd edition Springer-Verlag Berlin Heidelberg 2002
描述It was more than a surprise to us that the first edition of this book already went out of print about a year after its first appearance. We were flattered 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 errors detected so far have been corrected in this second edition, and references have been updated. Moreover, the first preface had a flaw. We listed all individuals who helped us in preparing this book. But we forgot to mention the institutional support, for which we make amends here. It is evident that a book project which took seven years benefited from many different grants. We would like to mention explicitly the bilateral Hungarian- German Research Project, sponsored by the Hungarian Academy of Sciences and the Deutsche Forschungsgemeinschaft, two Sonderforschungsbereiche (special re- search units) of the Deutsche Forschungsgemeinschaft, the Ministere Franc;ais de la Recherche et de la Technologie and the Alexander von Humboldt Foundation
出版日期Textbook 20022nd edition
關鍵詞Discrete Algorithms; Matching; Matchings; Mathematica; Mathematical Programming; algorithms; approximation
版次2
doihttps://doi.org/10.1007/978-3-662-21711-5
isbn_ebook978-3-662-21711-5Series ISSN 0937-5511 Series E-ISSN 2197-6783
issn_series 0937-5511
copyrightSpringer-Verlag Berlin Heidelberg 2002
The information of publication is updating

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




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




書目名稱Combinatorial Optimization網絡公開度




書目名稱Combinatorial Optimization網絡公開度學科排名




書目名稱Combinatorial Optimization被引頻次




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




書目名稱Combinatorial Optimization年度引用




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




書目名稱Combinatorial Optimization讀者反饋




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




單選投票, 共有 1 人參與投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

1票 100.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒有投票權限
沙發(fā)
發(fā)表于 2025-3-21 21:56:10 | 只看該作者
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.
板凳
發(fā)表于 2025-3-22 04:21:34 | 只看該作者
,-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.
地板
發(fā)表于 2025-3-22 05:23:01 | 只看該作者
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
5#
發(fā)表于 2025-3-22 10:21:59 | 只看該作者
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.
6#
發(fā)表于 2025-3-22 16:40:30 | 只看該作者
7#
發(fā)表于 2025-3-22 19:49:06 | 只看該作者
https://doi.org/10.1007/978-3-662-21711-5Discrete Algorithms; Matching; Matchings; Mathematica; Mathematical Programming; algorithms; approximation
8#
發(fā)表于 2025-3-23 01:14:11 | 只看該作者
9#
發(fā)表于 2025-3-23 04:55:18 | 只看該作者
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:
10#
發(fā)表于 2025-3-23 06:04:44 | 只看該作者
 關于派博傳思  派博傳思旗下網站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網 吾愛論文網 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經驗總結 SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網安備110108008328) GMT+8, 2025-10-5 12:52
Copyright © 2001-2015 派博傳思   京公網安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
镇康县| 南江县| 昭平县| 息烽县| 巴塘县| 邮箱| 青神县| 焉耆| 宿迁市| 伊宁市| 麻栗坡县| 皋兰县| 丰原市| 罗平县| 清丰县| 泰宁县| 三门县| 遂平县| 甘孜县| 中牟县| 江孜县| 六安市| 宜兰市| 宝应县| 辽源市| 辉南县| 彩票| 西畴县| 浮山县| 丰镇市| 南木林县| 电白县| 江川县| 临夏县| 黄浦区| 兴安县| 垦利县| 平武县| 民和| 荃湾区| 贵德县|