Informs Journal on Computing最新文献

筛选
英文 中文
Exact and Approximation Algorithms for Sparse Principal Component Analysis 稀疏主成分分析的精确算法和近似算法
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2024-07-01 DOI: 10.1287/ijoc.2022.0372
Yongchun Li, Weijun Xie
{"title":"Exact and Approximation Algorithms for Sparse Principal Component Analysis","authors":"Yongchun Li, Weijun Xie","doi":"10.1287/ijoc.2022.0372","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0372","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"68 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141507688","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Efficient Project Scheduling with Autonomous Learning Opportunities 利用自主学习机会进行高效项目调度
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2024-06-27 DOI: 10.1287/ijoc.2023.0107
Alessandro Hill, Thomas W. M. Vossen
{"title":"Efficient Project Scheduling with Autonomous Learning Opportunities","authors":"Alessandro Hill, Thomas W. M. Vossen","doi":"10.1287/ijoc.2023.0107","DOIUrl":"https://doi.org/10.1287/ijoc.2023.0107","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"88 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141507684","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Satisficing Approach to On-Demand Ride Matching 按需配车的满意度方法
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2024-06-25 DOI: 10.1287/ijoc.2021.0210
Dongling Rong, Xinyu Sun, Meilin Zhang, Shuangchi He
{"title":"Satisficing Approach to On-Demand Ride Matching","authors":"Dongling Rong, Xinyu Sun, Meilin Zhang, Shuangchi He","doi":"10.1287/ijoc.2021.0210","DOIUrl":"https://doi.org/10.1287/ijoc.2021.0210","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"164 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141507685","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An Efficient Scenario Reduction Method for Problems with Higher Moment Coherent Risk Measures 针对高矩阵相干风险度量问题的高效情景还原法
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2024-06-18 DOI: 10.1287/ijoc.2022.0375
Xiaolei He, Weiguo Zhang
{"title":"An Efficient Scenario Reduction Method for Problems with Higher Moment Coherent Risk Measures","authors":"Xiaolei He, Weiguo Zhang","doi":"10.1287/ijoc.2022.0375","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0375","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"157 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141507686","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Fusion Pretrained Approach for Identifying the Cause of Sarcasm Remarks 用于识别讽刺话语原因的融合预训练方法
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2024-06-13 DOI: 10.1287/ijoc.2022.0285
Qiudan Li, David Jingjun Xu, Haoda Qian, Linzi Wang, Minjie Yuan, Daniel Dajun Zeng
{"title":"A Fusion Pretrained Approach for Identifying the Cause of Sarcasm Remarks","authors":"Qiudan Li, David Jingjun Xu, Haoda Qian, Linzi Wang, Minjie Yuan, Daniel Dajun Zeng","doi":"10.1287/ijoc.2022.0285","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0285","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"72 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141507687","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Efficient Nested Simulation Experiment Design via the Likelihood Ratio Method 通过似然比法进行高效嵌套模拟实验设计
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2024-06-12 DOI: 10.1287/ijoc.2022.0392
Ben Mingbin Feng, Eunhye Song
{"title":"Efficient Nested Simulation Experiment Design via the Likelihood Ratio Method","authors":"Ben Mingbin Feng, Eunhye Song","doi":"10.1287/ijoc.2022.0392","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0392","url":null,"abstract":"<p>In the nested simulation literature, a common assumption is that the experimenter can choose the number of outer scenarios to sample. This paper considers the case when the experimenter is given a fixed set of outer scenarios from an external entity. We propose a nested simulation experiment design that pools inner replications from one scenario to estimate another scenario’s conditional mean via the likelihood ratio method. Given the outer scenarios, we decide how many inner replications to run at each outer scenario as well as how to pool the inner replications by solving a bilevel optimization problem that minimizes the total simulation effort. We provide asymptotic analyses on the convergence rates of the performance measure estimators computed from the optimized experiment design. Under some assumptions, the optimized design achieves <span><math altimg=\"eq-00001.gif\" display=\"inline\"><mrow><mi mathvariant=\"script\">O</mi><mo stretchy=\"false\">(</mo><msup><mrow><mi mathvariant=\"normal\">Γ</mi></mrow><mrow><mo>−</mo><mn>1</mn></mrow></msup><mo stretchy=\"false\">)</mo></mrow></math></span><span></span> mean squared error of the estimators given simulation budget <span><math altimg=\"eq-00002.gif\" display=\"inline\"><mi mathvariant=\"normal\">Γ</mi></math></span><span></span>. Numerical experiments demonstrate that our design outperforms a state-of-the-art design that pools replications via regression.</p><p><b>History:</b> Accepted by Bruno Tuffin, Area Editor for Simulation.</p><p><b>Funding:</b> This work was supported by the National Science Foundation [Grant CMMI-2045400] and the Natural Sciences and Engineering Research Council of Canada [Grant RGPIN-2018-03755].</p><p><b>Supplemental Material:</b> The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0392) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0392). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/.</p>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"184 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141507643","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Stochastic First-Order Algorithms for Constrained Distributionally Robust Optimization 约束分布式鲁棒优化的随机一阶算法
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2024-06-10 DOI: 10.1287/ijoc.2023.0167
Hyungki Im, Paul Grigas
{"title":"Stochastic First-Order Algorithms for Constrained Distributionally Robust Optimization","authors":"Hyungki Im, Paul Grigas","doi":"10.1287/ijoc.2023.0167","DOIUrl":"https://doi.org/10.1287/ijoc.2023.0167","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"21 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141532126","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Comparisons of Two-Stage Models for Flood Mitigation of Electrical Substations 变电站防洪两阶段模型比较
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2024-06-05 DOI: 10.1287/ijoc.2023.0125
Brent Austgen, Erhan Kutanoglu, John J. Hasenbein, Surya Santoso
{"title":"Comparisons of Two-Stage Models for Flood Mitigation of Electrical Substations","authors":"Brent Austgen, Erhan Kutanoglu, John J. Hasenbein, Surya Santoso","doi":"10.1287/ijoc.2023.0125","DOIUrl":"https://doi.org/10.1287/ijoc.2023.0125","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"13 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141526693","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Coordinating Charging Request Allocation Between Self-Interested Navigation Service Platforms 协调自利导航服务平台之间的收费请求分配
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2024-06-04 DOI: 10.1287/ijoc.2022.0269
Marianne Guillet, Maximilian Schiffer
{"title":"Coordinating Charging Request Allocation Between Self-Interested Navigation Service Platforms","authors":"Marianne Guillet, Maximilian Schiffer","doi":"10.1287/ijoc.2022.0269","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0269","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"33 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141253533","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An Enhanced Alternating Direction Method of Multipliers-Based Interior Point Method for Linear and Conic Optimization 基于增强型交替方向乘法的线性和圆锥优化内部点法
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2024-05-31 DOI: 10.1287/ijoc.2023.0017
Qi Deng, Qing Feng, Wenzhi Gao, Dongdong Ge, Bo Jiang, Yuntian Jiang, Jingsong Liu, Tianhao Liu, Chenyu Xue, Yinyu Ye, Chuwen Zhang
{"title":"An Enhanced Alternating Direction Method of Multipliers-Based Interior Point Method for Linear and Conic Optimization","authors":"Qi Deng, Qing Feng, Wenzhi Gao, Dongdong Ge, Bo Jiang, Yuntian Jiang, Jingsong Liu, Tianhao Liu, Chenyu Xue, Yinyu Ye, Chuwen Zhang","doi":"10.1287/ijoc.2023.0017","DOIUrl":"https://doi.org/10.1287/ijoc.2023.0017","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"75 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141188218","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
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学术官方微信