基于成本的滤波算法求解有容量批量问题和受限树形问题

IF 0.5 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
V. R. Houndji
{"title":"基于成本的滤波算法求解有容量批量问题和受限树形问题","authors":"V. R. Houndji","doi":"10.1007/s10601-018-9292-7","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":55211,"journal":{"name":"Constraints","volume":"23 1","pages":"481 - 482"},"PeriodicalIF":0.5000,"publicationDate":"2018-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10601-018-9292-7","citationCount":"0","resultStr":"{\"title\":\"Cost-based filtering algorithms for a Capacitated Lot Sizing Problem and the Constrained Arborescence Problem\",\"authors\":\"V. R. Houndji\",\"doi\":\"10.1007/s10601-018-9292-7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":55211,\"journal\":{\"name\":\"Constraints\",\"volume\":\"23 1\",\"pages\":\"481 - 482\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2018-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1007/s10601-018-9292-7\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Constraints\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s10601-018-9292-7\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Constraints","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s10601-018-9292-7","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

本文章由计算机程序翻译,如有差异,请以英文原文为准。
Cost-based filtering algorithms for a Capacitated Lot Sizing Problem and the Constrained Arborescence Problem
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Constraints
Constraints 工程技术-计算机:理论方法
CiteScore
2.20
自引率
0.00%
发文量
17
审稿时长
>12 weeks
期刊介绍: Constraints provides a common forum for the many disciplines interested in constraint programming and constraint satisfaction and optimization, and the many application domains in which constraint technology is employed. It covers all aspects of computing with constraints: theory and practice, algorithms and systems, reasoning and programming, logics and languages.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信