整数线性向量优化问题的交互式方法

W. Habenicht
{"title":"整数线性向量优化问题的交互式方法","authors":"W. Habenicht","doi":"10.1109/MCDM.2007.369444","DOIUrl":null,"url":null,"abstract":"We present a conceptual framework of an interactive method for solving integer linear vector optimization problems. The method is based on an enumerative cut approach. It combines cutting planes with enumerative parts. In this method the user can perform a structured searching process in the non-dominated set","PeriodicalId":306422,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An interactive approach to integer linear vector optimization problems using enumerative cuts\",\"authors\":\"W. Habenicht\",\"doi\":\"10.1109/MCDM.2007.369444\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a conceptual framework of an interactive method for solving integer linear vector optimization problems. The method is based on an enumerative cut approach. It combines cutting planes with enumerative parts. In this method the user can perform a structured searching process in the non-dominated set\",\"PeriodicalId\":306422,\"journal\":{\"name\":\"2007 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MCDM.2007.369444\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MCDM.2007.369444","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们提出了求解整数线性向量优化问题的交互式方法的概念框架。该方法基于枚举切割方法。它结合了切割平面和枚举部件。在该方法中,用户可以在非支配集中执行结构化搜索过程
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An interactive approach to integer linear vector optimization problems using enumerative cuts
We present a conceptual framework of an interactive method for solving integer linear vector optimization problems. The method is based on an enumerative cut approach. It combines cutting planes with enumerative parts. In this method the user can perform a structured searching process in the non-dominated set
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Multi-criteria Set Partitioning for Portfolio Management: A Visual Interactive Method Exploring Robustness of Plans for Simulation-Based Course of Action Planning: A Framework and an Example On the Convergence of Multi-Objective Descent Algorithms Prediction of Stock Price Movements Based on Concept Map Information Interactive Utility Maximization in Multi-Objective Vehicle Routing Problems: A "Decision Maker in the Loop"-Approach
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1