找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Combinatorial Optimization; Theory and Algorithm Bernhard Korte,Jens Vygen Textbook 20084th edition Springer-Verlag Berlin Heidelberg 2008

[复制链接]
查看: 23742|回复: 58
发表于 2025-3-21 19:33:48 | 显示全部楼层 |阅读模式
书目名称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 20084th edition Springer-Verlag Berlin Heidelberg 2008
描述.This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. It contains complete but concise proofs, also for many deep results, some of which did not appear in a textbook before. Many very recent topics are covered as well, and many references are provided. Thus this book represents the state of the art of combinatorial optimization. ..This fourth edition is again significantly extended, most notably with new material on linear programming, the network simplex algorithm, and the max-cut problem. Many further additions and updates are included as well. ..From the reviews of the previous editions:.."This book on combinatorial optimization is a beautiful example of the ideal textbook."..Operations Research Letters 33 (2005), p.216-217.."The second edition (with corrections and many updates) of this very recommendable book documents the relevant knowledge on combinatorial optimization and records those problems and algorithms that define this discipl
出版日期Textbook 20084th edition
关键词Combinatorial Optimization; Mathematical Programming; algorithms; discrete algorithms; linear optimizati
版次4
doihttps://doi.org/10.1007/978-3-540-71844-4
isbn_softcover978-3-642-09092-9
isbn_ebook978-3-540-71844-4Series ISSN 0937-5511 Series E-ISSN 2197-6783
issn_series 0937-5511
copyrightSpringer-Verlag Berlin Heidelberg 2008
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 20:39:19 | 显示全部楼层
发表于 2025-3-22 03:56:00 | 显示全部楼层
Ivan I. Fishchuk,Andrey Kadashchukwe consider two 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 14.5.
发表于 2025-3-22 06:45:23 | 显示全部楼层
https://doi.org/10.1007/978-1-4939-2547-6mum of the horizontal and the vertical distance. This is often called the ℓ.-distance. (Older machines can only move either horizontally or vertically at a time; in this case the adjusting time is proportional to the ℓ.-distance, the sum of the horizontal and the vertical distance.)
发表于 2025-3-22 12:08:22 | 显示全部楼层
Helmut Sitter,Claudia Draxl,Michael Ramseyinimum capacity .-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 14:05:41 | 显示全部楼层
发表于 2025-3-22 19:41:57 | 显示全部楼层
,-Matchings and ,-Joins,inimum capacity .-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-23 00:34:26 | 显示全部楼层
0937-5511 supplementary material: .This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special top
发表于 2025-3-23 01:32:42 | 显示全部楼层
Bin Yi,Kristina Larter,Yaguang Xihe edges correspond to the cables. By Theorem 2.4 the minimal connected spanning subgraphs of a given graph are its spanning trees. So we look for a spanning tree of minimum weight, where we say that a subgraph . of a graph . with weights . : .(.) → ℝ has weight .(.(.))=∑..(.).
发表于 2025-3-23 07:15:44 | 显示全部楼层
Spanning Trees and Arborescences,he edges correspond to the cables. By Theorem 2.4 the minimal connected spanning subgraphs of a given graph are its spanning trees. So we look for a spanning tree of minimum weight, where we say that a subgraph . of a graph . with weights . : .(.) → ℝ has weight .(.(.))=∑..(.).
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-4 15:15
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表