AFIT 自主性与导航 组合背包和集合覆盖问题域中的多目标数据库查询—2022年

VIP文档

ID:26659

大小:2.08 MB

页数:22页

时间:2022-12-10

金币:5

上传者:战必胜
Air Force Institute of Technology Air Force Institute of Technology
AFIT Scholar AFIT Scholar
Faculty Publications
2021
Multi-objective Database Queries in Combined Knapsack and Set Multi-objective Database Queries in Combined Knapsack and Set
Covering Problem Domains Covering Problem Domains
Sean A. Mochocki
Gary B. Lamont
Air Force Institute of Technology
Robert C. Leishman
Air Force Institute of Technology
Kyle J. Kauffman
Follow this and additional works at: https://scholar.a>t.edu/facpub
Part of the Data Science Commons
Recommended Citation Recommended Citation
Mochocki, S. A., Lamont, G. B., Leishman, R. C., & Kauffman, K. J. (2021). Multi-objective database queries
in combined knapsack and set covering problem domains. Journal of Big Data, 8(1), Art. 46.
https://doi.org/10.1186/s40537-021-00433-x
This Article is brought to you for free and open access by AFIT Scholar. It has been accepted for inclusion in
Faculty Publications by an authorized administrator of AFIT Scholar. For more information, please contact
richard.mans>eld@a>t.edu.
资源描述:

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。
关闭