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

Conference on Integer Programming and Combinatorial Optimization最新文献

筛选
英文 中文
Graph Coloring and Semidefinite Rank 图着色与半定秩
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2022-02-21 DOI: 10.1007/978-3-031-06901-7_29
Renee Mirka, Devin Smedira, David P. Williamson
{"title":"Graph Coloring and Semidefinite Rank","authors":"Renee Mirka, Devin Smedira, David P. Williamson","doi":"10.1007/978-3-031-06901-7_29","DOIUrl":"https://doi.org/10.1007/978-3-031-06901-7_29","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"86 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116307640","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}
引用次数: 0
LP-Based Approximations for Disjoint Bilinear and Two-Stage Adjustable Robust Optimization 基于lp的不相交双线性两阶段可调鲁棒优化逼近
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2021-12-01 DOI: 10.1007/978-3-031-06901-7_17
Omar El Housni, Ayoub Foussoul, Vineet Goyal
{"title":"LP-Based Approximations for Disjoint Bilinear and Two-Stage Adjustable Robust Optimization","authors":"Omar El Housni, Ayoub Foussoul, Vineet Goyal","doi":"10.1007/978-3-031-06901-7_17","DOIUrl":"https://doi.org/10.1007/978-3-031-06901-7_17","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"10 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114133659","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}
引用次数: 1
An Abstract Model for Branch-and-Cut 一种枝切的抽象模型
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2021-11-18 DOI: 10.1007/s10107-023-01991-z
Aleksandr M. Kazachkov, P. L. Bodic, S. Sankaranarayanan
{"title":"An Abstract Model for Branch-and-Cut","authors":"Aleksandr M. Kazachkov, P. L. Bodic, S. Sankaranarayanan","doi":"10.1007/s10107-023-01991-z","DOIUrl":"https://doi.org/10.1007/s10107-023-01991-z","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127385179","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}
引用次数: 0
Matroid-Based TSP Rounding for Half-Integral Solutions 半积分解的基于矩阵的TSP舍入
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2021-11-17 DOI: 10.1007/978-3-031-06901-7_23
Anupam Gupta, Euiwoong Lee, Jason Li, M. Mucha, Heather Newman, Sherry Sarkar
{"title":"Matroid-Based TSP Rounding for Half-Integral Solutions","authors":"Anupam Gupta, Euiwoong Lee, Jason Li, M. Mucha, Heather Newman, Sherry Sarkar","doi":"10.1007/978-3-031-06901-7_23","DOIUrl":"https://doi.org/10.1007/978-3-031-06901-7_23","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126792979","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}
引用次数: 4
Lattice-Free Simplices with Lattice Width 2d - o(d) 点阵宽度为2d - 0 (d)的无点阵简单体
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2021-11-16 DOI: 10.1007/978-3-031-06901-7_28
Lukas Mayrhofer, Jamico Schade, Stefan Weltge
{"title":"Lattice-Free Simplices with Lattice Width 2d - o(d)","authors":"Lukas Mayrhofer, Jamico Schade, Stefan Weltge","doi":"10.1007/978-3-031-06901-7_28","DOIUrl":"https://doi.org/10.1007/978-3-031-06901-7_28","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"184 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124679133","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}
引用次数: 4
On Circuit Diameter Bounds via Circuit Imbalances 基于电路不平衡的电路直径边界
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2021-11-15 DOI: 10.1007/978-3-031-06901-7_11
D. Dadush, Zhuan Khye Koh, Bento Natura, L. V'egh
{"title":"On Circuit Diameter Bounds via Circuit Imbalances","authors":"D. Dadush, Zhuan Khye Koh, Bento Natura, L. V'egh","doi":"10.1007/978-3-031-06901-7_11","DOIUrl":"https://doi.org/10.1007/978-3-031-06901-7_11","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121256666","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}
引用次数: 4
Neural networks with linear threshold activations: structure and algorithms 具有线性阈值激活的神经网络:结构和算法
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2021-11-15 DOI: 10.1007/978-3-031-06901-7_26
Sammy Khalife, A. Basu
{"title":"Neural networks with linear threshold activations: structure and algorithms","authors":"Sammy Khalife, A. Basu","doi":"10.1007/978-3-031-06901-7_26","DOIUrl":"https://doi.org/10.1007/978-3-031-06901-7_26","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130532747","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
Sparse Multi-term Disjunctive Cuts for the Epigraph of a Function of Binary Variables 二元变量函数题词的稀疏多项析取切
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2021-11-15 DOI: 10.1007/978-3-031-06901-7_8
Rui Chen, James R. Luedtke
{"title":"Sparse Multi-term Disjunctive Cuts for the Epigraph of a Function of Binary Variables","authors":"Rui Chen, James R. Luedtke","doi":"10.1007/978-3-031-06901-7_8","DOIUrl":"https://doi.org/10.1007/978-3-031-06901-7_8","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132027287","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}
引用次数: 1
SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs 一类整数非线性双层规划的基于sopp的析取分割
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2021-11-12 DOI: 10.1007/978-3-031-06901-7_20
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
{"title":"SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs","authors":"Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis","doi":"10.1007/978-3-031-06901-7_20","DOIUrl":"https://doi.org/10.1007/978-3-031-06901-7_20","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124004171","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}
引用次数: 2
A Constant-Factor Approximation for Generalized Malleable Scheduling Under $M^natural $-Concave Processing Speeds $M^自然$-凹加工速度下广义可塑调度的常因子逼近
Conference on Integer Programming and Combinatorial Optimization Pub Date : 2021-11-12 DOI: 10.1007/978-3-031-06901-7_18
D. Fotakis, J. Matuschke, O. Papadigenopoulos
{"title":"A Constant-Factor Approximation for Generalized Malleable Scheduling Under $M^natural $-Concave Processing Speeds","authors":"D. Fotakis, J. Matuschke, O. Papadigenopoulos","doi":"10.1007/978-3-031-06901-7_18","DOIUrl":"https://doi.org/10.1007/978-3-031-06901-7_18","url":null,"abstract":"","PeriodicalId":421894,"journal":{"name":"Conference on Integer Programming and Combinatorial Optimization","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116055081","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}
引用次数: 0
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信