找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Integer Programming and Combinatorial Optimization; 9th International IP William J. Cook,Andreas S. Schulz Conference proceedings 2002 Spri

[复制链接]
查看: 28625|回复: 61
发表于 2025-3-21 17:22:56 | 显示全部楼层 |阅读模式
书目名称Integer Programming and Combinatorial Optimization
副标题9th International IP
编辑William J. Cook,Andreas S. Schulz
视频video
概述Includes supplementary material:
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Integer Programming and Combinatorial Optimization; 9th International IP William J. Cook,Andreas S. Schulz Conference proceedings 2002 Spri
描述This volume contains the papers selected for presentation at IPCO 2002, the NinthInternationalConferenceonIntegerProgrammingandCombinatorial- timization, Cambridge, MA (USA), May 27–29, 2002. The IPCO series of c- ferences highlights recent developments in theory, computation, and application of integer programming and combinatorial optimization. IPCO was established in 1988 when the ?rst IPCO program committee was formed. IPCO is held every year in which no International Symposium on Ma- ematical Programming (ISMP) takes places. The ISMP is triennial, so IPCO conferences are held twice in every three-year period. The eight previous IPCO conferences were held in Waterloo (Canada) 1990, Pittsburgh (USA) 1992, Erice (Italy) 1993, Copenhagen (Denmark) 1995, Vancouver (Canada) 1996, Houston (USA) 1998, Graz (Austria) 1999, and Utrecht (The Netherlands) 2001. In response to the call for papers for IPCO 2002, the program committee received 110 submissions, a record number for IPCO. The program committee met on January 7 and 8, 2002, in Aussois (France), and selected 33 papers for inclusion in the scienti?c program of IPCO 2002. The selection was based on originality and quality, and re?e
出版日期Conference proceedings 2002
关键词Approximation; Combinatorics; Computational Complexity; Computational Geometry; Graph Algorithms; Integer
版次1
doihttps://doi.org/10.1007/3-540-47867-1
isbn_softcover978-3-540-43676-8
isbn_ebook978-3-540-47867-6Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2002
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 20:24:44 | 显示全部楼层
发表于 2025-3-22 02:47:57 | 显示全部楼层
发表于 2025-3-22 04:51:02 | 显示全部楼层
发表于 2025-3-22 11:31:42 | 显示全部楼层
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem,We design a new approximation algorithm for the metric uncapacitated facility location problem. This algorithm is of LP rounding type and is based on a rounding technique developed in [.,.,.].
发表于 2025-3-22 15:33:36 | 显示全部楼层
发表于 2025-3-22 17:59:44 | 显示全部楼层
发表于 2025-3-22 22:51:29 | 显示全部楼层
A New Min-Cut Max-Flow Ratio for Multicommodity Flows,tio, capacity of a cut is scaled by the demand that has to cross the cut. In the denominator, the maximum concurrent flow value is used. Our new bound is proportional to log(.*) where .* is the cardinality of the minimal vertex cover of the demand graph.
发表于 2025-3-23 01:50:20 | 显示全部楼层
发表于 2025-3-23 07:21:22 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-25 04:14
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表