找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
查看: 32401|回复: 58
发表于 2025-3-21 16:25:16 | 显示全部楼层 |阅读模式
书目名称Combinatorial Optimization
副标题Theory and Algorithm
编辑Bernhard Korte,Jens Vygen
视频video
概述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

您所在的用户组没有投票权限
发表于 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.
发表于 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.
发表于 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
发表于 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.
发表于 2025-3-22 16:40:30 | 显示全部楼层
发表于 2025-3-22 19:49:06 | 显示全部楼层
https://doi.org/10.1007/978-3-662-21711-5Discrete Algorithms; Matching; Matchings; Mathematica; Mathematical Programming; algorithms; approximation
发表于 2025-3-23 01:14:11 | 显示全部楼层
发表于 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:
发表于 2025-3-23 06:04:44 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-2 20:46
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表