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

Informs Journal on Computing最新文献

筛选
英文 中文
A Column Generation Scheme for Distributionally Robust Multi-Item Newsvendor Problems 分布式稳健多项目新闻供应商问题的列生成方案
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2024-01-03 DOI: 10.1287/ijoc.2022.0010
Shanshan Wang, Erick Delage
{"title":"A Column Generation Scheme for Distributionally Robust Multi-Item Newsvendor Problems","authors":"Shanshan Wang, Erick Delage","doi":"10.1287/ijoc.2022.0010","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0010","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"119 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139093574","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
VRPSolverEasy: A Python Library for the Exact Solution of a Rich Vehicle Routing Problem VRPSolverEasy：精确解决丰富车辆路由问题的 Python 库
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2023-12-28 DOI: 10.1287/ijoc.2023.0103
Najib Errami, Eduardo Queiroga, Ruslan Sadykov, Eduardo Uchoa
{"title":"VRPSolverEasy: A Python Library for the Exact Solution of a Rich Vehicle Routing Problem","authors":"Najib Errami, Eduardo Queiroga, Ruslan Sadykov, Eduardo Uchoa","doi":"10.1287/ijoc.2023.0103","DOIUrl":"https://doi.org/10.1287/ijoc.2023.0103","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"11 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2023-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139062978","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
Sparsity-Exploiting Distributed Projections onto a Simplex 利用稀疏性对复数进行分布式投影
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2023-12-27 DOI: 10.1287/ijoc.2022.0328
Yongzheng Dai, Chen Chen
{"title":"Sparsity-Exploiting Distributed Projections onto a Simplex","authors":"Yongzheng Dai, Chen Chen","doi":"10.1287/ijoc.2022.0328","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0328","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"14 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2023-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139054591","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
Minimizing the Weighted Number of Tardy Jobs via (max,+)-Convolutions 通过 (max,+)-Convolutions 最大限度减少迟到工作的加权数量
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2023-12-21 DOI: 10.1287/ijoc.2022.0307
Danny Hermelin, Hendrik Molter, Dvir Shabtay
{"title":"Minimizing the Weighted Number of Tardy Jobs via (max,+)-Convolutions","authors":"Danny Hermelin, Hendrik Molter, Dvir Shabtay","doi":"10.1287/ijoc.2022.0307","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0307","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"250 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2023-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139027782","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
Supervised ML for Solving the GI/GI/1 Queue 解决 GI/GI/1 队列问题的有监督 ML
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2023-12-21 DOI: 10.1287/ijoc.2022.0263
Opher Baron, Dmitry Krass, Arik Senderovich, Eliran Sherzer
{"title":"Supervised ML for Solving the GI/GI/1 Queue","authors":"Opher Baron, Dmitry Krass, Arik Senderovich, Eliran Sherzer","doi":"10.1287/ijoc.2022.0263","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0263","url":null,"abstract":"We apply supervised learning to a general problem in queueing theory: using a neural net, we develop a fast and accurate predictor of the stationary system-length distribution of a GI/GI/1 queue—a fundamental queueing model for which no analytical solutions are available. To this end, we must overcome three main challenges: (i) generating a large library of training instances that cover a wide range of arbitrary interarrival and service time distributions, (ii) labeling the training instances, and (iii) providing continuous arrival and service distributions as inputs to the neural net. To overcome (i), we develop an algorithm to sample phase-type interarrival and service time distributions with complex transition structures. We demonstrate that our distribution-generating algorithm indeed covers a wide range of possible positive-valued distributions. For (ii), we label our training instances via quasi-birth-and-death(QBD) that was used to approximate PH/PH/1 (with phase-type arrival and service process) as labels for the training data. For (iii), we find that using only the first five moments of both the interarrival and service times distribution as inputs is sufficient to train the neural net. Our empirical results show that our neural model can estimate the stationary behavior of the GI/GI/1—far exceeding other available methods in terms of both accuracy and runtimes. History: Ram Ramesh, Area Editor for Data Science and Machine Learning. Funding: O. Baron received financial support from the Natural Sciences and Engineering Research Council of Canada (NERC) [Grant 458051]. D. Krass received financial support from the NERC [Grant 458395]. Supplemental Material: 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.0263 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0263 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"52 4","pages":""},"PeriodicalIF":2.1,"publicationDate":"2023-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138951215","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 Sequential Follower Refinement Algorithm for Robust Surgery Scheduling 用于稳健手术排期的序列跟随者完善算法
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2023-12-20 DOI: 10.1287/ijoc.2022.0191
Ankit Bansal, Jean-Philippe Richard, Bjorn P. Berg, Yu-Li Huang
{"title":"A Sequential Follower Refinement Algorithm for Robust Surgery Scheduling","authors":"Ankit Bansal, Jean-Philippe Richard, Bjorn P. Berg, Yu-Li Huang","doi":"10.1287/ijoc.2022.0191","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0191","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"81 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2023-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138824355","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 Global Optimal Method for Cardinality Constrained Portfolio Optimization 一种有效的、全局最优的、受 Cardinality 约束的投资组合优化方法
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2023-12-20 DOI: 10.1287/ijoc.2022.0344
Wei Xu, Jie Tang, Ka Fai Cedric Yiu, Jian Wen Peng
{"title":"An Efficient Global Optimal Method for Cardinality Constrained Portfolio Optimization","authors":"Wei Xu, Jie Tang, Ka Fai Cedric Yiu, Jian Wen Peng","doi":"10.1287/ijoc.2022.0344","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0344","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"204 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2023-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138824414","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
Correlation Clustering Problem Under Mediation 调解下的相关聚类问题
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2023-12-19 DOI: 10.1287/ijoc.2022.0129
Zacharie Ales, Céline Engelbeen, Rosa Figueiredo
{"title":"Correlation Clustering Problem Under Mediation","authors":"Zacharie Ales, Céline Engelbeen, Rosa Figueiredo","doi":"10.1287/ijoc.2022.0129","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0129","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"15 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2023-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138742959","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
The Descent–Ascent Algorithm for DC Programming 直流编程的下降-上升算法
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2023-12-14 DOI: 10.1287/ijoc.2023.0142
Pietro D’Alessandro, Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico
{"title":"The Descent–Ascent Algorithm for DC Programming","authors":"Pietro D’Alessandro, Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico","doi":"10.1287/ijoc.2023.0142","DOIUrl":"https://doi.org/10.1287/ijoc.2023.0142","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"2 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138692616","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
Heuristic Search for Rank Aggregation with Application to Label Ranking 应用于标签排序的等级聚合启发式搜索
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2023-12-14 DOI: 10.1287/ijoc.2022.0019
Yangming Zhou, Jin-Kao Hao, Zhen Li, Fred Glover
{"title":"Heuristic Search for Rank Aggregation with Application to Label Ranking","authors":"Yangming Zhou, Jin-Kao Hao, Zhen Li, Fred Glover","doi":"10.1287/ijoc.2022.0019","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0019","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"36 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138692415","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学术官方微信