期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2018
卷号：18
期号：11
页码：60-67
出版社：International Journal of Computer Science and Network Security
摘要：In this paper, we present a new optimization technique for integer linear programming problems. The proposed method is a metaheuristic algorithm and improves solutions by iterating the problem reduction and solving the reduced problem. The algorithm is a hybrid approach in which we use a Metropolis-Hastings algorithm and an exact solver and has a good characteristic such that the reduced problem at each iteration has better or equal quality feasible solutions. The experimental evaluation shows that our method can obtain a good quality of solutions within reasonable execution time for hard problems specified in MIPLIB2010.
关键词：Integer Programming; Iterative Optimization; Problem Reduction; Monte Carlo Method; Metaheuristics
