发布求助
文献互助 智能选刊 最新文献

Conference on Integer Programming and Combinatorial Optimization最新文献

筛选
英文 中文
Cutting Planes from Wide Split Disjunctions 从宽裂的断结中切割平面
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2017-06-26 DOI: 10.1007/978-3-319-59250-3_9
Pierre Bonami, Andrea Lodi, Andrea Tramontani, Sven Wiese
{"title":"Cutting Planes from Wide Split Disjunctions","authors":"Pierre Bonami, Andrea Lodi, Andrea Tramontani, Sven Wiese","doi":"10.1007/978-3-319-59250-3_9","DOIUrl":"https://doi.org/10.1007/978-3-319-59250-3_9","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130743872","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Approximation of Corner Polyhedra with Families of Intersection Cuts 具有交切族的角多面体逼近
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2017-05-04 DOI: 10.1007/978-3-319-59250-3_5
G. Averkov, A. Basu, Joseph Paat
{"title":"Approximation of Corner Polyhedra with Families of Intersection Cuts","authors":"G. Averkov, A. Basu, Joseph Paat","doi":"10.1007/978-3-319-59250-3_5","DOIUrl":"https://doi.org/10.1007/978-3-319-59250-3_5","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128153701","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Discrete Newton's Algorithm for Parametric Submodular Function Minimization 参数次模函数最小化的离散牛顿算法
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2017-05-01 DOI: 10.1007/978-3-319-59250-3_18
M. Goemans, Swati Gupta, Patrick Jaillet
{"title":"Discrete Newton's Algorithm for Parametric Submodular Function Minimization","authors":"M. Goemans, Swati Gupta, Patrick Jaillet","doi":"10.1007/978-3-319-59250-3_18","DOIUrl":"https://doi.org/10.1007/978-3-319-59250-3_18","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125087313","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
Local Guarantees in Graph Cuts and Clustering 图割与聚类中的局部保证
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2017-04-02 DOI: 10.1007/978-3-319-59250-3_12
M. Charikar, Neha Gupta, Roy Schwartz
{"title":"Local Guarantees in Graph Cuts and Clustering","authors":"M. Charikar, Neha Gupta, Roy Schwartz","doi":"10.1007/978-3-319-59250-3_12","DOIUrl":"https://doi.org/10.1007/978-3-319-59250-3_12","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129397005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 24
Enumeration of Integer Points in Projections of Unbounded Polyhedra 无界多面体投影中整数点的枚举
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2016-12-23 DOI: 10.1007/978-3-319-59250-3_34
Danny Nguyen, I. Pak
{"title":"Enumeration of Integer Points in Projections of Unbounded Polyhedra","authors":"Danny Nguyen, I. Pak","doi":"10.1007/978-3-319-59250-3_34","DOIUrl":"https://doi.org/10.1007/978-3-319-59250-3_34","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127363413","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Mixed-Integer Linear Representability, Disjunctions, and Variable Elimination 混合整数线性可表示性、析取和变量消去
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2016-12-20 DOI: 10.1007/978-3-319-59250-3_7
A. Basu, Kipp Martin, C. Ryan, Guanyi Wang
{"title":"Mixed-Integer Linear Representability, Disjunctions, and Variable Elimination","authors":"A. Basu, Kipp Martin, C. Ryan, Guanyi Wang","doi":"10.1007/978-3-319-59250-3_7","DOIUrl":"https://doi.org/10.1007/978-3-319-59250-3_7","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"2021 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115313742","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
The Structure of the Infinite Models in Integer Programming 整数规划中无限模型的结构
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-59250-3_6
A. Basu, M. Conforti, M. D. Summa, Joseph Paat
{"title":"The Structure of the Infinite Models in Integer Programming","authors":"A. Basu, M. Conforti, M. D. Summa, Joseph Paat","doi":"10.1007/978-3-319-59250-3_6","DOIUrl":"https://doi.org/10.1007/978-3-319-59250-3_6","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131123378","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Equilibrium Computation in Atomic Splittable Singleton Congestion Games 原子可分裂单例拥塞对策的平衡计算
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2016-12-01 DOI: 10.1007/978-3-319-59250-3_36
T. Harks, V. Timmermans
{"title":"Equilibrium Computation in Atomic Splittable Singleton Congestion Games","authors":"T. Harks, V. Timmermans","doi":"10.1007/978-3-319-59250-3_36","DOIUrl":"https://doi.org/10.1007/978-3-319-59250-3_36","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116879941","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems 共享单车系统的多模函数最小化与容量分配
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2016-11-28 DOI: 10.1111/POMS.12965
Daniel Freund, S. Henderson, D. Shmoys
{"title":"Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems","authors":"Daniel Freund, S. Henderson, D. Shmoys","doi":"10.1111/POMS.12965","DOIUrl":"https://doi.org/10.1111/POMS.12965","url":null,"abstract":"Station-based bike-sharing systems have changed the urban landscape of major American cities including New York City, Boston, Washington DC, and Chicago. In these systems, stations are capacitated: a station’s capacity is given by the number of docks it consists of. Each dock can either be filled with a bike or empty with the number of bikes at the station fluctuating throughout the day. Interestingly, in these systems, stockouts can occur both when stations are empty (making rentals impossible) and when stations are full (making returns impossible). Avoiding stockouts of either type is the most pressing operational concern faced by these systems. Our work on capacity management in bike-sharing systems studies the strategic question of how to size stations in these systems in order to minimize stockouts of either kind. Our findings suggest that reallocating a small portion of the capacity within a system is a cost-efficient way to significantly improve service levels.","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128316714","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 57
Verifying Integer Programming Results 验证整数规划结果
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2016-11-27 DOI: 10.1007/978-3-319-59250-3_13
Kevin K. H. Cheung, A. Gleixner, Daniel E. Steffy
{"title":"Verifying Integer Programming Results","authors":"Kevin K. H. Cheung, A. Gleixner, Daniel E. Steffy","doi":"10.1007/978-3-319-59250-3_13","DOIUrl":"https://doi.org/10.1007/978-3-319-59250-3_13","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"289 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121329571","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 21
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信