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

International Symposium on Combinatorial Optimization最新文献

筛选
英文 中文
On Disjunction Convex Hulls by Lifting 论通过提升解结凸壳
International Symposium on Combinatorial Optimization Pub Date : 2024-07-21 DOI: 10.1007/978-3-031-60924-4_1
Yushan Qu, Jon Lee
{"title":"On Disjunction Convex Hulls by Lifting","authors":"Yushan Qu, Jon Lee","doi":"10.1007/978-3-031-60924-4_1","DOIUrl":"https://doi.org/10.1007/978-3-031-60924-4_1","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"92 21","pages":"3-15"},"PeriodicalIF":0.0,"publicationDate":"2024-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141818809","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
Few Induced Disjoint Paths for H-Free Graphs H-Free图的几种诱导不相交路径
International Symposium on Combinatorial Optimization Pub Date : 2022-03-07 DOI: 10.48550/arXiv.2203.03319
B. Martin, D. Paulusma, Siani Smith, E. J. V. Leeuwen
{"title":"Few Induced Disjoint Paths for H-Free Graphs","authors":"B. Martin, D. Paulusma, Siani Smith, E. J. V. Leeuwen","doi":"10.48550/arXiv.2203.03319","DOIUrl":"https://doi.org/10.48550/arXiv.2203.03319","url":null,"abstract":"Paths $P^1,ldots,P^k$ in a graph $G=(V,E)$ are mutually induced if any two distinct $P^i$ and $P^j$ have neither common vertices nor adjacent vertices. For a fixed integer $k$, the $k$-Induced Disjoint Paths problem is to decide if a graph $G$ with $k$ pairs of specified vertices $(s_i,t_i)$ contains $k$ mutually induced paths $P^i$ such that each $P^i$ starts from $s_i$ and ends at $t_i$. Whereas the non-induced version is well-known to be polynomial-time solvable for every fixed integer $k$, a classical result from the literature states that even $2$-Induced Disjoint Paths is NP-complete. We prove new complexity results for $k$-Induced Disjoint Paths if the input is restricted to $H$-free graphs, that is, graphs without a fixed graph $H$ as an induced subgraph. We compare our results with a complexity dichotomy for Induced Disjoint Paths, the variant where $k$ is part of the input.","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128860458","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
New Classes of Facets for Complementarity Knapsack Problems 互补背包问题的新平面类
International Symposium on Combinatorial Optimization Pub Date : 2022-03-06 DOI: 10.1007/978-3-031-18530-4_1
Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu
{"title":"New Classes of Facets for Complementarity Knapsack Problems","authors":"Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu","doi":"10.1007/978-3-031-18530-4_1","DOIUrl":"https://doi.org/10.1007/978-3-031-18530-4_1","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128984159","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
Exact Price of Anarchy for Weighted Congestion Games with Two Players 两名玩家的加权拥堵游戏的无政府状态的确切价格
International Symposium on Combinatorial Optimization Pub Date : 2022-03-03 DOI: 10.48550/arXiv.2203.01740
Joran van den Bosse, M. Uetz, Matthias Walter
{"title":"Exact Price of Anarchy for Weighted Congestion Games with Two Players","authors":"Joran van den Bosse, M. Uetz, Matthias Walter","doi":"10.48550/arXiv.2203.01740","DOIUrl":"https://doi.org/10.48550/arXiv.2203.01740","url":null,"abstract":"This paper gives a complete analysis of worst-case equilibria for various versions of weighted congestion games with two players and affine cost functions. The results are exact price of anarchy bounds which are parametric in the weights of the two players, and establish exactly how the primitives of the game enter into the quality of equilibria. Interestingly, some of the worst-cases are attained when the players' weights only differ slightly. Our findings also show that sequential play improves the price of anarchy in all cases, however, this effect vanishes with an increasing difference in the players' weights. Methodologically, we obtain exact price of anarchy bounds by a duality based proof mechanism, based on a compact linear programming formulation that computes worst-case instances. This mechanism yields duality-based optimality certificates which can eventually be turned into purely algebraic proofs.","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121312267","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
On Finding Shortest Paths in Arc-Dependent Networks 求弧相关网络中的最短路径
International Symposium on Combinatorial Optimization Pub Date : 2020-05-04 DOI: 10.1007/978-3-030-53262-8_21
P. Wojciechowski, M. Williamson, K. Subramani
{"title":"On Finding Shortest Paths in Arc-Dependent Networks","authors":"P. Wojciechowski, M. Williamson, K. Subramani","doi":"10.1007/978-3-030-53262-8_21","DOIUrl":"https://doi.org/10.1007/978-3-030-53262-8_21","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115499314","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
Polynomial Scheduling Algorithm for Parallel Applications on Hybrid Platforms 混合平台上并行应用的多项式调度算法
International Symposium on Combinatorial Optimization Pub Date : 2020-05-04 DOI: 10.1007/978-3-030-53262-8_12
Massinissa Ait Aba, Lilia Zaourar, Alix Munier Kordon
{"title":"Polynomial Scheduling Algorithm for Parallel Applications on Hybrid Platforms","authors":"Massinissa Ait Aba, Lilia Zaourar, Alix Munier Kordon","doi":"10.1007/978-3-030-53262-8_12","DOIUrl":"https://doi.org/10.1007/978-3-030-53262-8_12","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128851466","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
Notes on Equitable Partitions into Matching Forests in Mixed Graphs and b-branchings in Digraphs 混合图中匹配森林的公平划分和有向图中b分支的注释
International Symposium on Combinatorial Optimization Pub Date : 2020-05-04 DOI: 10.1007/978-3-030-53262-8_18
Kenjiro Takazawa
{"title":"Notes on Equitable Partitions into Matching Forests in Mixed Graphs and b-branchings in Digraphs","authors":"Kenjiro Takazawa","doi":"10.1007/978-3-030-53262-8_18","DOIUrl":"https://doi.org/10.1007/978-3-030-53262-8_18","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116793715","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
Anchored Rescheduling Problems Under Generalized Precedence Constraints 广义优先约束下的锚定重调度问题
International Symposium on Combinatorial Optimization Pub Date : 2020-05-04 DOI: 10.1007/978-3-030-53262-8_13
P. Bendotti, P. Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau
{"title":"Anchored Rescheduling Problems Under Generalized Precedence Constraints","authors":"P. Bendotti, P. Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau","doi":"10.1007/978-3-030-53262-8_13","DOIUrl":"https://doi.org/10.1007/978-3-030-53262-8_13","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129691075","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
Cardinality Constrained Multilinear Sets 基数约束的多线性集
International Symposium on Combinatorial Optimization Pub Date : 2020-05-04 DOI: 10.1007/978-3-030-53262-8_5
Rui Chen, S. Dash, O. Günlük
{"title":"Cardinality Constrained Multilinear Sets","authors":"Rui Chen, S. Dash, O. Günlük","doi":"10.1007/978-3-030-53262-8_5","DOIUrl":"https://doi.org/10.1007/978-3-030-53262-8_5","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132898482","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}
引用次数: 6
Cut and Flow Formulations for the Balanced Connected k-Partition Problem 平衡连通k-划分问题的切割和流动公式
International Symposium on Combinatorial Optimization Pub Date : 2020-05-04 DOI: 10.1007/978-3-030-53262-8_11
F. Miyazawa, Phablo F. S. Moura, M. J. Ota, Yoshiko Wakabayashi
{"title":"Cut and Flow Formulations for the Balanced Connected k-Partition Problem","authors":"F. Miyazawa, Phablo F. S. Moura, M. J. Ota, Yoshiko Wakabayashi","doi":"10.1007/978-3-030-53262-8_11","DOIUrl":"https://doi.org/10.1007/978-3-030-53262-8_11","url":null,"abstract":"","PeriodicalId":307867,"journal":{"name":"International Symposium on Combinatorial Optimization","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124058772","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
下一页 尾页
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学术官方微信