找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Combinatorial Optimization; Theory and Algorithm Bernhard Korte,Jens Vygen Textbook 2018Latest edition Springer-Verlag GmbH Germany, part o

[复制链接]
查看: 26010|回复: 67
发表于 2025-3-21 16:10:35 | 显示全部楼层 |阅读模式
书目名称Combinatorial Optimization
副标题Theory and Algorithm
编辑Bernhard Korte,Jens Vygen
视频video
概述Well-written, popular textbook on combinatorial optimization.One of very few textbooks on this topic.Subject area has manifold applications.Offers complete but concise proofs, making it an invaluable
丛书名称Algorithms and Combinatorics
图书封面Titlebook: Combinatorial Optimization; Theory and Algorithm Bernhard Korte,Jens Vygen Textbook 2018Latest edition Springer-Verlag GmbH Germany, part o
描述.This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. .This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ɛ)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues torepresent the state of the art of combinatorial optimization..
出版日期Textbook 2018Latest edition
关键词combinatorial optimization; discrete algorithms; mathematical programming; graphs; integer linear progra
版次6
doihttps://doi.org/10.1007/978-3-662-56039-6
isbn_softcover978-3-662-58566-5
isbn_ebook978-3-662-56039-6Series ISSN 0937-5511 Series E-ISSN 2197-6783
issn_series 0937-5511
copyrightSpringer-Verlag GmbH Germany, part of Springer Nature 2018
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

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:15:28 | 显示全部楼层
发表于 2025-3-22 01:14:43 | 显示全部楼层
Generalizations of Matroids, approaches to the problem of minimizing an arbitrary submodular function: one using the ., and one with a combinatorial algorithm. For the important special case of symmetric submodular functions we mention a simpler algorithm in Section .. Finally, in Section ., we discuss the problem of maximizing a submodular function.
发表于 2025-3-22 08:07:28 | 显示全部楼层
https://doi.org/10.1007/978-0-8176-8214-9cally. Since both movements can be done simultaneously, the time needed to adjust the machine from one position to another is proportional to the maximum of the horizontal and the vertical distance. This is often called the ..-distance.
发表于 2025-3-22 10:36:41 | 显示全部楼层
Raffaele Testorelli,Anna Tiso,Chiara Verbano approaches to the problem of minimizing an arbitrary submodular function: one using the ., and one with a combinatorial algorithm. For the important special case of symmetric submodular functions we mention a simpler algorithm in Section .. Finally, in Section ., we discuss the problem of maximizing a submodular function.
发表于 2025-3-22 14:14:59 | 显示全部楼层
发表于 2025-3-22 20:12:12 | 显示全部楼层
发表于 2025-3-22 23:56:27 | 显示全部楼层
发表于 2025-3-23 02:41:53 | 显示全部楼层
发表于 2025-3-23 06:44:06 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-30 06:18
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表