找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Combinatorial Optimization; Lectures given at th Bruno Simeone Conference proceedings 1989 Springer-Verlag Berlin Heidelberg 1989 algorithm

[复制链接]
查看: 45981|回复: 45
发表于 2025-3-21 18:58:21 | 显示全部楼层 |阅读模式
书目名称Combinatorial Optimization
副标题Lectures given at th
编辑Bruno Simeone
视频videohttp://file.papertrans.cn/230/229958/229958.mp4
丛书名称Lecture Notes in Mathematics
图书封面Titlebook: Combinatorial Optimization; Lectures given at th Bruno Simeone Conference proceedings 1989 Springer-Verlag Berlin Heidelberg 1989 algorithm
描述The C.I.M.E. Summer School at Como in 1986 was the first in that series on the subject of combinatorial optimization. Situated between combinatorics, computer science and operations research, the subject draws on a variety of mathematical methods to deal with problems motivated by real-life applications. Recent research has focussed on the connections to theoretical computer science, in particular to computational complexity and algorithmic issues. The Summer School‘s activity centered on the 4 main lecture courses, the notes of which are included in this volume:
出版日期Conference proceedings 1989
关键词algorithms; combinatorial optimization; combinatorics; operations research; optimization
版次1
doihttps://doi.org/10.1007/BFb0083460
isbn_softcover978-3-540-51797-9
isbn_ebook978-3-540-46810-3Series ISSN 0075-8434 Series E-ISSN 1617-9692
issn_series 0075-8434
copyrightSpringer-Verlag Berlin Heidelberg 1989
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 人参与投票
 

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:37:16 | 显示全部楼层
Hyperpaths and shortest hyperpaths,eneralized for a hyperpath. In particular, the shortest hyperpath problem is studied for a subclass of hyperpaths. Shortest hyperpath properties are derived from the classical one, and efficient algorithms are presented in detail.
发表于 2025-3-22 02:04:31 | 显示全部楼层
发表于 2025-3-22 07:25:11 | 显示全部楼层
Natalia Chaban,Serena Kelly,Anne-Marie Bradyoblems, polynomial-time algorithms are available for special classes of graphs. In the present paper, the class of line-graphs is considered and a polynomial algorithm is proposed to solve both UGP and SMP in this class.
发表于 2025-3-22 12:22:48 | 显示全部楼层
发表于 2025-3-22 15:46:23 | 显示全部楼层
https://doi.org/10.1007/BFb0083460algorithms; combinatorial optimization; combinatorics; operations research; optimization
发表于 2025-3-22 19:40:30 | 显示全部楼层
978-3-540-51797-9Springer-Verlag Berlin Heidelberg 1989
发表于 2025-3-22 23:13:10 | 显示全部楼层
Lecture Notes in Mathematicshttp://image.papertrans.cn/c/image/229958.jpg
发表于 2025-3-23 03:10:04 | 显示全部楼层
发表于 2025-3-23 08:57:58 | 显示全部楼层
Matthew Gibbons,Serena Kelly,Martin Hollandhe incidence matrix can be represented as a bipartite graph G=(X,Y,E), with the node sets partitioned into the sets X1, X2, Y1 en Y2, such that (a) there are no edges between X1 en Y2, and (b) the cardinality of X1+Y2 is maximum. Such a partition corresponds with the detection of complete and maxima
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-18 22:37
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表