混合约束问题的优化求解方法

2010 IEEE International Conference on Intelligent Computing and Intelligent Systems Pub Date : 2010-12-06 DOI:10.1109/ICICISYS.2010.5658781

Xiaohui Ji, Zhuo Huang

{"title":"混合约束问题的优化求解方法","authors":"Xiaohui Ji, Zhuo Huang","doi":"10.1109/ICICISYS.2010.5658781","DOIUrl":null,"url":null,"abstract":"This paper presents a new method that solves a mixed constraints problem by transforming it into a mixed integer programming problem. The method builds the connection between the feasibility of a mixed constraint problem and the solution to a mixed integer programming problem. The correctness of this method is proven. This method will be beneficial for the further integration of constraint programming and optimization methods.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimization method for mixed constraints problem solving\",\"authors\":\"Xiaohui Ji, Zhuo Huang\",\"doi\":\"10.1109/ICICISYS.2010.5658781\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new method that solves a mixed constraints problem by transforming it into a mixed integer programming problem. The method builds the connection between the feasibility of a mixed constraint problem and the solution to a mixed integer programming problem. The correctness of this method is proven. This method will be beneficial for the further integration of constraint programming and optimization methods.\",\"PeriodicalId\":339711,\"journal\":{\"name\":\"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICISYS.2010.5658781\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICISYS.2010.5658781","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

将混合约束问题转化为混合整数规划问题，提出了一种求解混合约束问题的新方法。该方法建立了混合约束问题的可行性与混合整数规划问题的解之间的联系。证明了该方法的正确性。该方法将有利于约束规划和优化方法的进一步整合。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Optimization method for mixed constraints problem solving

This paper presents a new method that solves a mixed constraints problem by transforming it into a mixed integer programming problem. The method builds the connection between the feasibility of a mixed constraint problem and the solution to a mixed integer programming problem. The correctness of this method is proven. This method will be beneficial for the further integration of constraint programming and optimization methods.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2010 IEEE International Conference on Intelligent Computing and Intelligent Systems

自引率

0.00%

发文量