找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Combinatorial Optimization; Third International Pierre Fouilhoux,Luis Eduardo Neves Gouveia,Vangel Conference proceedings 2014 Springer In

[复制链接]
查看: 51396|回复: 68
发表于 2025-3-21 19:33:24 | 显示全部楼层 |阅读模式
书目名称Combinatorial Optimization
副标题Third International
编辑Pierre Fouilhoux,Luis Eduardo Neves Gouveia,Vangel
视频video
概述Includes supplementary material:
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Combinatorial Optimization; Third International  Pierre Fouilhoux,Luis Eduardo Neves Gouveia,Vangel Conference proceedings 2014 Springer In
描述This book constitutes the thoroughly refereed post-conference proceedings of the Third International Symposium on Combinatorial Optimization, ISCO 2014, held in Lisbon, Portugal, in March 2014. The 37 revised full papers presented together with 64 short papers were carefully reviewed and selected from 97 submissions. They present original research on all aspects of combinatorial optimization, such as algorithms and complexity; mathematical programming; operations research; stochastic optimization; graphs and combinatorics.
出版日期Conference proceedings 2014
关键词algorithm; approximation; branch-and-cut; column generation; combinatorics; graph; metaheuristic; mixed int
版次1
doihttps://doi.org/10.1007/978-3-319-09174-7
isbn_softcover978-3-319-09173-0
isbn_ebook978-3-319-09174-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer International Publishing Switzerland 2014
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-22 00:11:54 | 显示全部楼层
发表于 2025-3-22 02:46:34 | 显示全部楼层
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229961.jpg
发表于 2025-3-22 05:15:13 | 显示全部楼层
发表于 2025-3-22 10:28:25 | 显示全部楼层
https://doi.org/10.1007/978-3-322-94415-3twork flow problems. We show that the function is piecewise hyperbolic, and modify a parametric optimization technique, the ES algorithm, to find this function. The running time of the algorithm is ., when . is a source-sink edge connectivity of our network, . is the number of links, and . is the nu
发表于 2025-3-22 14:32:10 | 显示全部楼层
发表于 2025-3-22 17:10:54 | 显示全部楼层
发表于 2025-3-22 21:24:29 | 显示全部楼层
发表于 2025-3-23 01:31:43 | 显示全部楼层
https://doi.org/10.1007/978-3-319-01104-2ery bin a cost function that is convex in the total load on this bin. These costs are subtracted from the profits of assigned items, and the task is to find an assignment maximizing the resulting net profit..We show that even restricted cases of this problem remain strongly NP-complete, and identify
发表于 2025-3-23 07:07:34 | 显示全部楼层
Detectors for Small-Animal SPECT I,. subsets . in . whose intersection size . is maximum. The M.SI problem is NP-hard and hard to approximate. Some applications of the M.SI problem can be found in the literature and, to the best of our knowledge, no exact method was proposed to solve this problem. In this work, we introduce a very ef
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-28 20:23
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表