找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

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

[復(fù)制鏈接]
查看: 13391|回復(fù): 40
樓主
發(fā)表于 2025-3-21 18:38:14 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Combinatorial Optimization
副標(biāo)題Theory and Algorithm
編輯Bernhard Korte,Jens Vygen
視頻videohttp://file.papertrans.cn/230/229950/229950.mp4
概述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 20125th edition Springer-Verlag Berlin Heidelberg 2012
描述.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 fifth edition has again been updated, revised, and significantly?extended, with more than 60 new exercises and new material on various?topics, including Cayley‘s formula, blocking flows, faster?.b.-matching separation, multidimensional knapsack, multicommodity?max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization..
出版日期Textbook 20125th edition
關(guān)鍵詞combinatorial optimization; discrete algorithms; mathematical programming; combinatorics
版次5
doihttps://doi.org/10.1007/978-3-642-24488-9
isbn_ebook978-3-642-24488-9Series ISSN 0937-5511 Series E-ISSN 2197-6783
issn_series 0937-5511
copyrightSpringer-Verlag Berlin Heidelberg 2012
The information of publication is updating

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




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




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




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




書目名稱Combinatorial Optimization被引頻次




書目名稱Combinatorial Optimization被引頻次學(xué)科排名




書目名稱Combinatorial Optimization年度引用




書目名稱Combinatorial Optimization年度引用學(xué)科排名




書目名稱Combinatorial Optimization讀者反饋




書目名稱Combinatorial Optimization讀者反饋學(xué)科排名




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

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

1票 100.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:47:33 | 只看該作者
板凳
發(fā)表于 2025-3-22 00:37:43 | 只看該作者
Textbook 20125th editionw exercises and new material on various?topics, including Cayley‘s formula, blocking flows, faster?.b.-matching separation, multidimensional knapsack, multicommodity?max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization..
地板
發(fā)表于 2025-3-22 07:31:42 | 只看該作者
Bernhard Korte,Jens VygenWell-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
5#
發(fā)表于 2025-3-22 08:49:45 | 只看該作者
6#
發(fā)表于 2025-3-22 14:12:38 | 只看該作者
https://doi.org/10.1007/978-3-642-24488-9combinatorial optimization; discrete algorithms; mathematical programming; combinatorics
7#
發(fā)表于 2025-3-22 17:40:52 | 只看該作者
8#
發(fā)表于 2025-3-22 21:43:08 | 只看該作者
Combinatorial Optimization978-3-642-24488-9Series ISSN 0937-5511 Series E-ISSN 2197-6783
9#
發(fā)表于 2025-3-23 04:54:57 | 只看該作者
10#
發(fā)表于 2025-3-23 08:25:59 | 只看該作者
CRNet: Centroid Radiation Network for Temporal Action Localizationg areas have the same action label, we obtain action boundaries by adopting random walk to propagate a centroid to its related areas. Our proposed method is an one-stage method and can be trained in an end-to-end fashion. Experimental results show that our approach outperforms the state-of-the-art methods on THUMOS14 and ActivityNet.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-2-1 11:16
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
赤峰市| 盈江县| 景德镇市| 紫金县| 嘉义县| 怀远县| 安塞县| 马鞍山市| 九寨沟县| 区。| 邛崃市| 南汇区| 子洲县| 罗田县| 阜康市| 永嘉县| 西乡县| 芒康县| 揭西县| 滦南县| 延津县| 哈巴河县| 平远县| 临夏市| 都匀市| 惠安县| 广宗县| 措美县| 凤山市| 灵武市| 沛县| 阳西县| 吉安县| 仙桃市| 修文县| 云林县| 黄龙县| 中山市| 慈利县| 巩留县| 庆阳市|