用于稳健组合优化的近似核学习不确定性集

IF 2.3 4区 计算机科学 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Informs Journal on Computing Pub Date : 2024-01-10 DOI:10.1287/ijoc.2022.0330
Benoît Loger, Alexandre Dolgui, Fabien Lehuédé, Guillaume Massonnet
{"title":"用于稳健组合优化的近似核学习不确定性集","authors":"Benoît Loger, Alexandre Dolgui, Fabien Lehuédé, Guillaume Massonnet","doi":"10.1287/ijoc.2022.0330","DOIUrl":null,"url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"25 1","pages":""},"PeriodicalIF":2.3000,"publicationDate":"2024-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Approximate Kernel Learning Uncertainty Set for Robust Combinatorial Optimization\",\"authors\":\"Benoît Loger, Alexandre Dolgui, Fabien Lehuédé, Guillaume Massonnet\",\"doi\":\"10.1287/ijoc.2022.0330\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"INFORMS Journal on Computing, Ahead of Print. <br/>\",\"PeriodicalId\":13620,\"journal\":{\"name\":\"Informs Journal on Computing\",\"volume\":\"25 1\",\"pages\":\"\"},\"PeriodicalIF\":2.3000,\"publicationDate\":\"2024-01-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Informs Journal on Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1287/ijoc.2022.0330\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Informs Journal on Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1287/ijoc.2022.0330","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

INFORMS 计算期刊》，印刷版。
本文章由计算机程序翻译，如有差异，请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Approximate Kernel Learning Uncertainty Set for Robust Combinatorial Optimization
INFORMS Journal on Computing, Ahead of Print.
求助全文
通过发布文献求助，成功后即可免费获取论文全文。 去求助
来源期刊
Informs Journal on Computing
Informs Journal on Computing 工程技术-计算机：跨学科应用
CiteScore
4.20
自引率
14.30%
发文量
162
审稿时长
7.5 months
期刊介绍： The INFORMS Journal on Computing (JOC) is a quarterly that publishes papers in the intersection of operations research (OR) and computer science (CS). Most papers contain original research, but we also welcome special papers in a variety of forms, including Feature Articles on timely topics, Expository Reviews making a comprehensive survey and evaluation of a subject area, and State-of-the-Art Reviews that collect and integrate recent streams of research.
期刊最新文献
An Efficient Node Selection Policy for Monte Carlo Tree Search with Neural Networks Combining Precision Boosting with LP Iterative Refinement for Exact Linear Optimization Pairwise Stability in Weighted Network Formation Games: Selection and Computation Forecasting Urban Traffic States with Sparse Data Using Hankel Temporal Matrix Factorization Multiobjective Linear Ensembles for Robust and Sparse Training of Few-Bit Neural Networks
×
引用
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