找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Integer Programming and Combinatorial Optimization; 16th International C Michel Goemans,José Correa Conference proceedings 2013 Springer-Ve

[复制链接]
查看: 20813|回复: 63
发表于 2025-3-21 18:26:08 | 显示全部楼层 |阅读模式
书目名称Integer Programming and Combinatorial Optimization
副标题16th International C
编辑Michel Goemans,José Correa
视频video
概述Up to date results.Fast track conference proceedings.State of the art research
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Integer Programming and Combinatorial Optimization; 16th International C Michel Goemans,José Correa Conference proceedings 2013 Springer-Ve
描述This book constitutes the proceedings of the 16th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2013, held in Valparaíso, Chile, in March 2013. The 33 full papers presented were carefully reviewed and selected from 98 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization with the aim to present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.
出版日期Conference proceedings 2013
关键词co-graphic matroids; knapsack problem; multistage robust optimization; quadratic programming; scheduling
版次1
doihttps://doi.org/10.1007/978-3-642-36694-9
isbn_softcover978-3-642-36693-2
isbn_ebook978-3-642-36694-9Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2013
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 21:31:53 | 显示全部楼层
A Complexity and Approximability Study of the Bilevel Knapsack Problem,s the third is NP-complete. Furthermore we design a polynomial time approximation scheme for this third variant, whereas the other two variants cannot be approximated in polynomial time within any constant factor (assuming P≠NP).
发表于 2025-3-22 01:24:17 | 显示全部楼层
Intersection Cuts for Mixed Integer Conic Quadratic Sets,variables from the system and get a formula for the intersection cut in dimension three. This formula is finally generalized and proved for any dimension. The intersection cut we present generalizes a conic quadratic cut introduced by Modaresi, Kilinc and Vielma.
发表于 2025-3-22 05:41:43 | 显示全部楼层
0302-9743 l Conference on Integer Programming and Combinatorial Optimization, IPCO 2013, held in Valparaíso, Chile, in March 2013. The 33 full papers presented were carefully reviewed and selected from 98 submissions. The conference is a forum for researchers and practitioners working on various aspects of in
发表于 2025-3-22 11:57:10 | 显示全部楼层
Cut-Generating Functions,h cut-generating functions. This paper presents a formal theory of minimal cut-generating functions and maximal .-free sets which is valid independently of the particular .. This theory relies on tools of convex analysis.
发表于 2025-3-22 13:03:11 | 显示全部楼层
发表于 2025-3-22 21:06:29 | 显示全部楼层
0302-9743 CO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.978-3-642-36693-2978-3-642-36694-9Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-22 22:39:34 | 显示全部楼层
发表于 2025-3-23 03:44:55 | 显示全部楼层
发表于 2025-3-23 07:56:43 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-26 03:52
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表