摘要
文献〔1〕提出了求解整数规划问题的一种新方法——松驰邻域整点搜索法.文献〔2〕给出了松驰邻域整点搜索法的缺点,并做了改进.本文结合上述文献,对松驰邻域整点搜索法进行了改进.
In the paper 〔1〕,author proposed a new method of solving integer programming： search method of neighborhood integer point of the relax optimal solution.The paper〔2〕presented disadvantage of the above method and improved it.Based on above literature,this paper proposed a new improvement of this method.
出处
《内蒙古民族大学学报（自然科学版）》
2010年第6期604-606,共3页
Journal of Inner Mongolia Minzu University：Natural Sciences
关键词
整数规划
松驰问题
邻域整点搜索法
Integer programming
Relaxation problem
Search method of neighborhood integer point
