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

Informs Journal on Computing最新文献

筛选
英文 中文
Use of Machine Learning Models to Warmstart Column Generation for Unit Commitment 使用机器学习模型为单位承诺预热列生成
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2024-01-29 DOI: 10.1287/ijoc.2022.0140
Nagisa Sugishita, Andreas Grothey, Ken McKinnon
{"title":"Use of Machine Learning Models to Warmstart Column Generation for Unit Commitment","authors":"Nagisa Sugishita, Andreas Grothey, Ken McKinnon","doi":"10.1287/ijoc.2022.0140","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0140","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"29 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139589631","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 Neural Separation Algorithm for the Rounded Capacity Inequalities 四舍五入容量不等式的神经分离算法
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2024-01-23 DOI: 10.1287/ijoc.2022.0310
Hyeonah Kim, Jinkyoo Park, Changhyun Kwon
{"title":"A Neural Separation Algorithm for the Rounded Capacity Inequalities","authors":"Hyeonah Kim, Jinkyoo Park, Changhyun Kwon","doi":"10.1287/ijoc.2022.0310","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0310","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"58 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139552399","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
Largest Volume Inscribed Rectangles in Convex Sets Defined by Finite Number of Inequalities 用有限个不等式定义的凸集合中体积最大的刻划矩形
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2024-01-22 DOI: 10.1287/ijoc.2022.0239
Mehdi Behroozi
{"title":"Largest Volume Inscribed Rectangles in Convex Sets Defined by Finite Number of Inequalities","authors":"Mehdi Behroozi","doi":"10.1287/ijoc.2022.0239","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0239","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":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139517411","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
Product Redesign and Innovation Based on Online Reviews: A Multistage Combined Search Method 基于在线评论的产品再设计与创新：多阶段组合搜索法
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2024-01-17 DOI: 10.1287/ijoc.2022.0333
Jindong Qin, Pan Zheng, Xiaojun Wang
{"title":"Product Redesign and Innovation Based on Online Reviews: A Multistage Combined Search Method","authors":"Jindong Qin, Pan Zheng, Xiaojun Wang","doi":"10.1287/ijoc.2022.0333","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0333","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"12 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139495120","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
Iterative Rule Extension for Logic Analysis of Data: An MILP-Based Heuristic to Derive Interpretable Binary Classifiers from Large Data Sets 数据逻辑分析的迭代规则扩展：基于 MILP 的启发式方法，从大型数据集中推导出可解释的二元分类器
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2024-01-12 DOI: 10.1287/ijoc.2021.0284
Marleen Balvert
{"title":"Iterative Rule Extension for Logic Analysis of Data: An MILP-Based Heuristic to Derive Interpretable Binary Classifiers from Large Data Sets","authors":"Marleen Balvert","doi":"10.1287/ijoc.2021.0284","DOIUrl":"https://doi.org/10.1287/ijoc.2021.0284","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"42 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139463065","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
Solving Sparse Separable Bilinear Programs Using Lifted Bilinear Cover Inequalities 利用提升双线性覆盖不等式求解稀疏可分离双线性程序
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2024-01-10 DOI: 10.1287/ijoc.2022.0230
Xiaoyi Gu, Santanu S. Dey, Jean-Philippe P. Richard
{"title":"Solving Sparse Separable Bilinear Programs Using Lifted Bilinear Cover Inequalities","authors":"Xiaoyi Gu, Santanu S. Dey, Jean-Philippe P. Richard","doi":"10.1287/ijoc.2022.0230","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0230","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":"2024-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139423289","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
Approximate Kernel Learning Uncertainty Set for Robust Combinatorial Optimization 用于稳健组合优化的近似核学习不确定性集
IF 2.1 4区 计算机科学
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":"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":"https://doi.org/10.1287/ijoc.2022.0330","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.1,"publicationDate":"2024-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139409606","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
Note from the Editor 编辑说明
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2024-01-05 DOI: 10.1287/ijoc.2024.ed.v36.n1
Alice E. Smith
{"title":"Note from the Editor","authors":"Alice E. Smith","doi":"10.1287/ijoc.2024.ed.v36.n1","DOIUrl":"https://doi.org/10.1287/ijoc.2024.ed.v36.n1","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"65 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139374499","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 Propagation Techniques for Handling Cyclic Symmetries in Binary Programs 处理二进制程序中循环对称性的高效传播技术
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2024-01-04 DOI: 10.1287/ijoc.2022.0060
Jasper van Doornmalen, Christopher Hojny
{"title":"Efficient Propagation Techniques for Handling Cyclic Symmetries in Binary Programs","authors":"Jasper van Doornmalen, Christopher Hojny","doi":"10.1287/ijoc.2022.0060","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0060","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"62 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139103928","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
Solving a Class of Cut-Generating Linear Programs via Machine Learning 通过机器学习求解一类切割生成线性程序
IF 2.1 4区 计算机科学
Informs Journal on Computing Pub Date : 2024-01-04 DOI: 10.1287/ijoc.2022.0241
Atefeh Rajabalizadeh, Danial Davarnia
{"title":"Solving a Class of Cut-Generating Linear Programs via Machine Learning","authors":"Atefeh Rajabalizadeh, Danial Davarnia","doi":"10.1287/ijoc.2022.0241","DOIUrl":"https://doi.org/10.1287/ijoc.2022.0241","url":null,"abstract":"INFORMS Journal on Computing, Ahead of Print. <br/>","PeriodicalId":13620,"journal":{"name":"Informs Journal on Computing","volume":"26 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139104002","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学术官方微信