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

International Conference on Discrete Optimization and Operations Research最新文献

筛选
英文 中文
Wardrop Equilibrium for Networks with the BPR Latency Function 具有BPR延迟函数的网络的Wardrop均衡
International Conference on Discrete Optimization and Operations Research Pub Date : 2016-09-19 DOI: 10.1007/978-3-319-44914-2_4
J. Lien, V. Mazalov, A. Melnik, Jie Zheng
{"title":"Wardrop Equilibrium for Networks with the BPR Latency Function","authors":"J. Lien, V. Mazalov, A. Melnik, Jie Zheng","doi":"10.1007/978-3-319-44914-2_4","DOIUrl":"https://doi.org/10.1007/978-3-319-44914-2_4","url":null,"abstract":"","PeriodicalId":219202,"journal":{"name":"International Conference on Discrete Optimization and Operations Research","volume":"205 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131408664","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}
引用次数: 17
An Algorithm with Approximation Ratio 5/6 for the Metric Maximum m-PSP 一个近似比为5/6的度量最大值m-PSP算法
International Conference on Discrete Optimization and Operations Research Pub Date : 2016-09-19 DOI: 10.1007/978-3-319-44914-2_13
A. Glebov, Anastasiya V. Gordeeva
{"title":"An Algorithm with Approximation Ratio 5/6 for the Metric Maximum m-PSP","authors":"A. Glebov, Anastasiya V. Gordeeva","doi":"10.1007/978-3-319-44914-2_13","DOIUrl":"https://doi.org/10.1007/978-3-319-44914-2_13","url":null,"abstract":"","PeriodicalId":219202,"journal":{"name":"International Conference on Discrete Optimization and Operations Research","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114095908","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
Facility Location in Unfair Competition 不正当竞争中的设施选址
International Conference on Discrete Optimization and Operations Research Pub Date : 2016-09-19 DOI: 10.1007/978-3-319-44914-2_26
V. Beresnev, A. Melnikov
{"title":"Facility Location in Unfair Competition","authors":"V. Beresnev, A. Melnikov","doi":"10.1007/978-3-319-44914-2_26","DOIUrl":"https://doi.org/10.1007/978-3-319-44914-2_26","url":null,"abstract":"","PeriodicalId":219202,"journal":{"name":"International Conference on Discrete Optimization and Operations Research","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114062871","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
Upper Bound for the Competitive Facility Location Problem with Quantile Criterion 基于分位数准则的竞争性设施选址问题的上界
International Conference on Discrete Optimization and Operations Research Pub Date : 2016-09-19 DOI: 10.1007/978-3-319-44914-2_30
A. Melnikov, V. Beresnev
{"title":"Upper Bound for the Competitive Facility Location Problem with Quantile Criterion","authors":"A. Melnikov, V. Beresnev","doi":"10.1007/978-3-319-44914-2_30","DOIUrl":"https://doi.org/10.1007/978-3-319-44914-2_30","url":null,"abstract":"","PeriodicalId":219202,"journal":{"name":"International Conference on Discrete Optimization and Operations Research","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122436276","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
Extended Separating Plane Algorithm and NSO-Solutions of PageRank Problem 扩展分离平面算法与PageRank问题的nso解
International Conference on Discrete Optimization and Operations Research Pub Date : 2016-09-19 DOI: 10.1007/978-3-319-44914-2_43
E. Vorontsova
{"title":"Extended Separating Plane Algorithm and NSO-Solutions of PageRank Problem","authors":"E. Vorontsova","doi":"10.1007/978-3-319-44914-2_43","DOIUrl":"https://doi.org/10.1007/978-3-319-44914-2_43","url":null,"abstract":"","PeriodicalId":219202,"journal":{"name":"International Conference on Discrete Optimization and Operations Research","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122644920","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
Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization 用次模优化方法处理参数可控调度问题
International Conference on Discrete Optimization and Operations Research Pub Date : 2016-09-19 DOI: 10.1007/978-3-319-44914-2_7
A. Shioura, N. V. Shakhlevich, V. Strusevich
{"title":"Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization","authors":"A. Shioura, N. V. Shakhlevich, V. Strusevich","doi":"10.1007/978-3-319-44914-2_7","DOIUrl":"https://doi.org/10.1007/978-3-319-44914-2_7","url":null,"abstract":"","PeriodicalId":219202,"journal":{"name":"International Conference on Discrete Optimization and Operations Research","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128773916","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
Mixed Integer Programming Approach to Multiprocessor Job Scheduling with Setup Times 带设置时间的多处理机作业调度的混合整数规划方法
International Conference on Discrete Optimization and Operations Research Pub Date : 2016-09-19 DOI: 10.1007/978-3-319-44914-2_24
A. Eremeev, Y. Kovalenko
{"title":"Mixed Integer Programming Approach to Multiprocessor Job Scheduling with Setup Times","authors":"A. Eremeev, Y. Kovalenko","doi":"10.1007/978-3-319-44914-2_24","DOIUrl":"https://doi.org/10.1007/978-3-319-44914-2_24","url":null,"abstract":"","PeriodicalId":219202,"journal":{"name":"International Conference on Discrete Optimization and Operations Research","volume":"169 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131877041","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
Convergence of Discrete Approximations of Stochastic Programming Problems with Probabilistic Criteria 具有概率准则的随机规划问题离散逼近的收敛性
International Conference on Discrete Optimization and Operations Research Pub Date : 2016-09-19 DOI: 10.1007/978-3-319-44914-2_41
A. Kibzun, S. Ivanov
{"title":"Convergence of Discrete Approximations of Stochastic Programming Problems with Probabilistic Criteria","authors":"A. Kibzun, S. Ivanov","doi":"10.1007/978-3-319-44914-2_41","DOIUrl":"https://doi.org/10.1007/978-3-319-44914-2_41","url":null,"abstract":"","PeriodicalId":219202,"journal":{"name":"International Conference on Discrete Optimization and Operations Research","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133610265","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
Constant-Factor Approximations for Cycle Cover Problems 周期覆盖问题的常因子近似
International Conference on Discrete Optimization and Operations Research Pub Date : 2016-09-19 DOI: 10.1007/978-3-319-44914-2_8
A. Ageev
{"title":"Constant-Factor Approximations for Cycle Cover Problems","authors":"A. Ageev","doi":"10.1007/978-3-319-44914-2_8","DOIUrl":"https://doi.org/10.1007/978-3-319-44914-2_8","url":null,"abstract":"","PeriodicalId":219202,"journal":{"name":"International Conference on Discrete Optimization and Operations Research","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115482479","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
Linear Superiorization for Infeasible Linear Programming 非可行线性规划的线性优越性
International Conference on Discrete Optimization and Operations Research Pub Date : 2016-09-19 DOI: 10.1007/978-3-319-44914-2_2
Y. Censor, Y. Zur
{"title":"Linear Superiorization for Infeasible Linear Programming","authors":"Y. Censor, Y. Zur","doi":"10.1007/978-3-319-44914-2_2","DOIUrl":"https://doi.org/10.1007/978-3-319-44914-2_2","url":null,"abstract":"","PeriodicalId":219202,"journal":{"name":"International Conference on Discrete Optimization and Operations Research","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129447846","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
首页 上一页 下一页 尾页
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学术官方微信