Mixed-Integer Knapsack Problem Solving Method Using the Narrow Intervals for the Criterion Function and Variables

作     者：Mansimov, K. B. Mamedov, K. K. 

作者机构：Natl Acad Sci Azerbaijan Inst Cybernet Ul Agaeva 9 AZ-1141 Baku Azerbaijan 

出 版 物：《AUTOMATIC CONTROL AND COMPUTER SCIENCES》 (自动控制与计算机科学)

年 卷 期：2010年第44卷第4期

页      面：216-226页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 0811[工学-控制科学与工程] 

主　　题：mixed-integer programming integer-valued knapsack problem interval narrowing values of variables and functionals equivalent problem 

摘      要：A mixed-integer knapsack problem solving method is suggested. With this purpose, first, the number of integer-valued variables and the domain of feasible solutions (containing the optimal solution) are decreased. Further, the received problem is solved using the branch and bound type method, where the narrow intervals for the functional and variables are used while each is branching. The numerous computing experiments fulfilled have shown that the suggested method operates more rapidly than the known branch and bound method.