找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Combinatorial Optimization; Second International A. Ridha Mahjoub,Vangelis Markakis,Vangelis Th. Pa Conference proceedings 2012 Springer-Ve

[复制链接]
查看: 51825|回复: 58
发表于 2025-3-21 18:05:16 | 显示全部楼层 |阅读模式
书目名称Combinatorial Optimization
副标题Second International
编辑A. Ridha Mahjoub,Vangelis Markakis,Vangelis Th. Pa
视频videohttp://file.papertrans.cn/230/229956/229956.mp4
概述Up to date results.State of the art research.Fast track conference proceedings
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Combinatorial Optimization; Second International A. Ridha Mahjoub,Vangelis Markakis,Vangelis Th. Pa Conference proceedings 2012 Springer-Ve
描述This book constitutes the thoroughly refereed post-conference proceedings of the Second International Symposium on Combinatorial Optimization, ISCO 2012, held in Athens, Greece, in April 2012. The 37 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 94 regular and 30 short submissions. They present original research on all aspects of combinatorial optimization, ranging from mathematical foundations and theory of algorithms to computational studies and practical applications.
出版日期Conference proceedings 2012
关键词algorithms and complexity; graph problems; mathematical programming; networks; relaxation; algorithm anal
版次1
doihttps://doi.org/10.1007/978-3-642-32147-4
isbn_softcover978-3-642-32146-7
isbn_ebook978-3-642-32147-4Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2012
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 21:34:54 | 显示全部楼层
发表于 2025-3-22 04:19:02 | 显示全部楼层
The New Faces of Combinatorial Optimizationrch tradition: Multicriterion optimization, competitive equilibria, and optimizing with incentives. I also discuss the surprisingly weak connections between optimization and evolution (this latter topic was the subject of my ISCO talk).
发表于 2025-3-22 07:28:30 | 显示全部楼层
Models and Algorithms for the Train Unit Assignment Problempplication of mathematical models and optimization techniques, which generally lead to an improvement in the performance of the system, and also to a reduction in the time required for solving these problems. The planning process is generally divided into several phases: Line Planning, Train Timetab
发表于 2025-3-22 10:18:37 | 显示全部楼层
发表于 2025-3-22 13:49:11 | 显示全部楼层
Orbital Shrinkingducing artificial symmetry-breaking conditions into the problem, and/or by using an ad-hoc search strategy. In this paper we argue that symmetry is instead a beneficial feature that we should preserve and exploit as much as possible, breaking it only as a last resort. To this end, we outline a new a
发表于 2025-3-22 19:31:02 | 显示全部楼层
发表于 2025-3-22 23:20:08 | 显示全部楼层
A Second-Order Cone Programming Approximation to Joint Chance-Constrained Linear Programsmed to be normally distributed. The problem can be approximated by another stochastic program, whose optimal value is an upper bound of the original problem. The latter stochastic program can be approximated by two second-order cone programming (SOCP) problems [5]. Furthermore, in some cases, the op
发表于 2025-3-23 04:34:18 | 显示全部楼层
发表于 2025-3-23 07:10:36 | 显示全部楼层
The Non-Disjoint ,-Ring-Star Problem: Polyhedral Results and SDH/SONET Network Designof a ring. We first show that there is no two-index integer formulation for this problem. We then present a mathematical model for the NDRSP along with some classes of valid inequalities that are used as cutting planes in a Branch-and-Cut approach. We also study the dominant polytope of the NDRSP an
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-25 22:13
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表