找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Integer Programming and Combinatorial Optimization; 7th International IP Gérard Cornuéjols,Rainer E. Burkard,Gerhard J. Woe Conference proc

[复制链接]
查看: 31297|回复: 59
发表于 2025-3-21 16:21:47 | 显示全部楼层 |阅读模式
书目名称Integer Programming and Combinatorial Optimization
副标题7th International IP
编辑Gérard Cornuéjols,Rainer E. Burkard,Gerhard J. Woe
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Integer Programming and Combinatorial Optimization; 7th International IP Gérard Cornuéjols,Rainer E. Burkard,Gerhard J. Woe Conference proc
出版日期Conference proceedings 1999
关键词Graph; algorithms; combinatorial optimization; combinatorics; complexity; computational geometry; optimiza
版次1
doihttps://doi.org/10.1007/3-540-48777-8
isbn_softcover978-3-540-66019-4
isbn_ebook978-3-540-48777-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 1999
The information of publication is updating

书目名称Integer Programming and Combinatorial Optimization影响因子(影响力)




书目名称Integer Programming and Combinatorial Optimization影响因子(影响力)学科排名




书目名称Integer Programming and Combinatorial Optimization网络公开度




书目名称Integer Programming and Combinatorial Optimization网络公开度学科排名




书目名称Integer Programming and Combinatorial Optimization被引频次




书目名称Integer Programming and Combinatorial Optimization被引频次学科排名




书目名称Integer Programming and Combinatorial Optimization年度引用




书目名称Integer Programming and Combinatorial Optimization年度引用学科排名




书目名称Integer Programming and Combinatorial Optimization读者反馈




书目名称Integer Programming and Combinatorial Optimization读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:58:02 | 显示全部楼层
Solving the Convex Cost Integer Dual Network Flow Problem,imum cost flow problem can be adapted to solve the convex cost integer dual network flow problem in O(nm log(n./m) log(nU)) time. This algorithm improves the best currently available algorithm and is also likely to yield algorithms with attractive empirical performance.
发表于 2025-3-22 03:38:32 | 显示全部楼层
On the Separation of Maximally Violated mod-, Cuts,uires .(.min{.}) time. Applications to the TSP are discussed. In particular, for any given ., we propose an .(|.|.|.|)-time exact separation algorithm for mod-. cuts which are maximally violated by a given fractional TSP solution with support graph .* = (.*). This implies that we can identify a maxi
发表于 2025-3-22 04:39:18 | 显示全部楼层
发表于 2025-3-22 12:02:50 | 显示全部楼层
,Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube,s is O(.). The latter observation explains why for most cutting planes derived in polyhedral studies of several popular combinatorial optimization problems only linear growth has been observed (see, e.g., [.]); the coefficients of the corresponding inequalities are usually small. Similar results wer
发表于 2025-3-22 14:47:03 | 显示全部楼层
发表于 2025-3-22 20:02:49 | 显示全部楼层
发表于 2025-3-22 23:11:14 | 显示全部楼层
Integer Programming and Combinatorial Optimization7th International IP
发表于 2025-3-23 05:26:11 | 显示全部楼层
发表于 2025-3-23 05:51:58 | 显示全部楼层
Karen Aardal,Robert E. Bixby,Cor A. J. Hurkens,Arjen K. Lenstra,Job W. Smeltink
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-6 09:26
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表