在线叠加的渐近最优算法

IF 0.9 4区 数学 Q3 MATHEMATICS, APPLIED Mathematical Methods of Operations Research Pub Date : 2023-01-05 DOI:10.1007/s00186-022-00808-7
M. Olsen, L. N. Andersen, A. Gross
{"title":"在线叠加的渐近最优算法","authors":"M. Olsen, L. N. Andersen, A. Gross","doi":"10.1007/s00186-022-00808-7","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":49862,"journal":{"name":"Mathematical Methods of Operations Research","volume":"6 1","pages":"161-178"},"PeriodicalIF":0.9000,"publicationDate":"2023-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An asymptotically optimal algorithm for online stacking\",\"authors\":\"M. Olsen, L. N. Andersen, A. Gross\",\"doi\":\"10.1007/s00186-022-00808-7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":49862,\"journal\":{\"name\":\"Mathematical Methods of Operations Research\",\"volume\":\"6 1\",\"pages\":\"161-178\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2023-01-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical Methods of Operations Research\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s00186-022-00808-7\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Methods of Operations Research","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00186-022-00808-7","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An asymptotically optimal algorithm for online stacking
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.90
自引率
0.00%
发文量
36
审稿时长
>12 weeks
期刊介绍: This peer reviewed journal publishes original and high-quality articles on important mathematical and computational aspects of operations research, in particular in the areas of continuous and discrete mathematical optimization, stochastics, and game theory. Theoretically oriented papers are supposed to include explicit motivations of assumptions and results, while application oriented papers need to contain substantial mathematical contributions. Suggestions for algorithms should be accompanied with numerical evidence for their superiority over state-of-the-art methods. Articles must be of interest for a large audience in operations research, written in clear and correct English, and typeset in LaTeX. A special section contains invited tutorial papers on advanced mathematical or computational aspects of operations research, aiming at making such methodologies accessible for a wider audience. All papers are refereed. The emphasis is on originality, quality, and importance.
期刊最新文献
Low-complexity algorithm for restless bandits with imperfect observations Multi-stage distributionally robust convex stochastic optimization with Bayesian-type ambiguity sets A new value for communication situations On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem An approximation algorithm for multiobjective mixed-integer convex optimization
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1