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

Discret. Optim.最新文献

筛选
英文 中文
Stable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability 有限制边的稳定婚姻和室友问题:复杂性和近似性
Discret. Optim. Pub Date : 2014-11-30 DOI: 10.1007/978-3-662-48433-3_2
Ágnes Cseh, D. Manlove
{"title":"Stable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability","authors":"Ágnes Cseh, D. Manlove","doi":"10.1007/978-3-662-48433-3_2","DOIUrl":"https://doi.org/10.1007/978-3-662-48433-3_2","url":null,"abstract":"","PeriodicalId":440659,"journal":{"name":"Discret. Optim.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121306065","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}
引用次数: 26
A logarithmic method for eliminating binary variables and constraints for the product of free-sign discrete functions 一种消除二元变量和自由符号离散函数乘积约束的对数方法
Discret. Optim. Pub Date : 2013-02-01 DOI: 10.1016/j.disopt.2012.10.001
Hao-Chun Lu
{"title":"A logarithmic method for eliminating binary variables and constraints for the product of free-sign discrete functions","authors":"Hao-Chun Lu","doi":"10.1016/j.disopt.2012.10.001","DOIUrl":"https://doi.org/10.1016/j.disopt.2012.10.001","url":null,"abstract":"","PeriodicalId":440659,"journal":{"name":"Discret. Optim.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"118013370","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}
引用次数: 10
Computer-assisted proof of performance ratios for the Differencing Method 差分法性能比的计算机辅助证明
Discret. Optim. Pub Date : 2012-02-01 DOI: 10.1016/j.disopt.2011.10.001
Wil Michiels, E. Aarts, J. Korst, J. Leeuwen, F. Spieksma
{"title":"Computer-assisted proof of performance ratios for the Differencing Method","authors":"Wil Michiels, E. Aarts, J. Korst, J. Leeuwen, F. Spieksma","doi":"10.1016/j.disopt.2011.10.001","DOIUrl":"https://doi.org/10.1016/j.disopt.2011.10.001","url":null,"abstract":"","PeriodicalId":440659,"journal":{"name":"Discret. Optim.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120686772","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}
引用次数: 3
Emergency path restoration problems 紧急路径恢复问题
Discret. Optim. Pub Date : 2012-02-01 DOI: 10.1016/j.disopt.2012.01.001
I. Averbakh
{"title":"Emergency path restoration problems","authors":"I. Averbakh","doi":"10.1016/j.disopt.2012.01.001","DOIUrl":"https://doi.org/10.1016/j.disopt.2012.01.001","url":null,"abstract":"","PeriodicalId":440659,"journal":{"name":"Discret. Optim.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"119612191","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}
引用次数: 31
The Delivery Man Problem with time windows 有时间窗口的送货员问题
Discret. Optim. Pub Date : 2010-11-01 DOI: 10.1016/j.disopt.2010.06.002
Géraldine Heilporn, J. Cordeau, G. Laporte
{"title":"The Delivery Man Problem with time windows","authors":"Géraldine Heilporn, J. Cordeau, G. Laporte","doi":"10.1016/j.disopt.2010.06.002","DOIUrl":"https://doi.org/10.1016/j.disopt.2010.06.002","url":null,"abstract":"","PeriodicalId":440659,"journal":{"name":"Discret. Optim.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120551678","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}
引用次数: 35
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems 一些(伪)多项式问题的最小-最大(遗憾)版本的一般近似格式
Discret. Optim. Pub Date : 2010-08-01 DOI: 10.1016/j.disopt.2010.03.004
Hassene Aissi, C. Bazgan, D. Vanderpooten
{"title":"General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems","authors":"Hassene Aissi, C. Bazgan, D. Vanderpooten","doi":"10.1016/j.disopt.2010.03.004","DOIUrl":"https://doi.org/10.1016/j.disopt.2010.03.004","url":null,"abstract":"","PeriodicalId":440659,"journal":{"name":"Discret. Optim.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120563236","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}
引用次数: 28
Graph-based data clustering with overlaps 具有重叠的基于图的数据聚类
Discret. Optim. Pub Date : 2009-07-11 DOI: 10.1007/978-3-642-02882-3_51
M. Fellows, Jiong Guo, Christian Komusiewicz, R. Niedermeier, Johannes Uhlmann
{"title":"Graph-based data clustering with overlaps","authors":"M. Fellows, Jiong Guo, Christian Komusiewicz, R. Niedermeier, Johannes Uhlmann","doi":"10.1007/978-3-642-02882-3_51","DOIUrl":"https://doi.org/10.1007/978-3-642-02882-3_51","url":null,"abstract":"","PeriodicalId":440659,"journal":{"name":"Discret. Optim.","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133514131","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}
引用次数: 90
Information-theoretic approaches to branching in search 分支搜索的信息论方法
Discret. Optim. Pub Date : 2006-05-08 DOI: 10.1145/1160633.1160732
Andrew Gilpin, T. Sandholm
{"title":"Information-theoretic approaches to branching in search","authors":"Andrew Gilpin, T. Sandholm","doi":"10.1145/1160633.1160732","DOIUrl":"https://doi.org/10.1145/1160633.1160732","url":null,"abstract":"Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all information-theoretically motivated to reduce uncertainty in remaining subproblems. In the first family, a good variable to branch on is selected based on lookahead. In real-world procurement optimization, this entropic branching method outperforms default CPLEX and strong branching. The second family combines this idea with strong branching. The third family does not use lookahead, but instead exploits features of the underlying structure of the problem. Experiments show that this family significantly outperforms the state-of-the-art branching strategy when the problem includes indicator variables as the key driver of complexity. The fourth family is about branching using carefully constructed linear inequality constraints over sets of variables.","PeriodicalId":440659,"journal":{"name":"Discret. Optim.","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114688243","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}
引用次数: 45
Partitioning cographs into cliques and stable sets 将图划分为团和稳定集
Discret. Optim. Pub Date : 2005-06-01 DOI: 10.1016/j.disopt.2005.03.003
M. Demange, T. Ekim, D. Werra
{"title":"Partitioning cographs into cliques and stable sets","authors":"M. Demange, T. Ekim, D. Werra","doi":"10.1016/j.disopt.2005.03.003","DOIUrl":"https://doi.org/10.1016/j.disopt.2005.03.003","url":null,"abstract":"","PeriodicalId":440659,"journal":{"name":"Discret. Optim.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117845738","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}
引用次数: 33
Ordered optimal solutions and parametric minimum cut problems 有序最优解和参数最小割问题
Discret. Optim. Pub Date : 2005-06-01 DOI: 10.1016/j.disopt.2005.03.002
S. Brumelle, D. Granot, Li Liu
{"title":"Ordered optimal solutions and parametric minimum cut problems","authors":"S. Brumelle, D. Granot, Li Liu","doi":"10.1016/j.disopt.2005.03.002","DOIUrl":"https://doi.org/10.1016/j.disopt.2005.03.002","url":null,"abstract":"","PeriodicalId":440659,"journal":{"name":"Discret. Optim.","volume":"227 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117813401","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}
引用次数: 10
首页 上一页 下一页 尾页
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学术官方微信