Выходит 12 номеров в год
ISSN Печать: 1064-2315
ISSN Онлайн: 2163-9337
Indexed in
Solving Knapsack Problem: Postoptimality Analysis and Branch and Bound Method
Get access
Краткое описание
The algorithm of postoptimality analysis is proposed for determining exact solutions of family of knapsack problems including an initial problem. The computational experiment shows that the average time of solving the family problem is at least 10 times less than the time of solving the initial problem by branch and bound method.
-
Kozeratskaya L.N., Lebedeva T.T., Sergienko I.V., Stability matters, parametric and postoptimal analysis of discrete optimization problems.
-
Sergienko I.V., Shilo V.P., Discrete optimization problems. Problems, solution methods, investigations.
-
Geoffrion A.M., Nauss R., Parametric and postoptimality analysis in integer linear programming.
-
Roodman G.M., Postoptimality analysis in zero one programming by implicit enumeration.
-
Greenberg H.J., An annotated bibliography for post-solution analysis in mixed integer programming and combinatorial optimization.
-
Woodruff D.L., Advances in computational and stochastic optimization, logic programming and heuristic search.
-
Sigal I.H., Ivanova A.P., Introduction to applied discrete programming: models and computation algorithms.
-
Garey M., Johnson D.S., Computers and intractability.
-
Martello S., Toth P., Knapsack problems. Algorithms and computer implementations.
-
Mikhailyuk V.A., General approach to estimating the complexity of postoptimality analysis for discrete optimization problems.