A modification of a method for a class of problems in integer programming
type: Item
instance of: scholarly article
title: A modification of a method for a class of problems in integer programming
zbMATH Open document ID: 0947.90072
author: V. G. Anisimov
author: E. G. Anisimov
published in: Computational Mathematics and Mathematical Physics
publication date: 2000-06-19T00:00:00Z
review text: A modification of a method designed for solving separable integer programming problems with nonlinear goal functions is proposed. Earlier the author gave a solution algorithm based on the general branch-and-bound method. The estimated upper bound used before ensures that the algorithm is sufficiently effective when the amount of the \(i\)-th resource \(R_i\leq 1\). However, when \(R_i> 1\), this estimate is rough, and the algorithm is substantially less efficient. In this paper the authors improve the efficiency of the algorithm proposed earlier for the above cited optimization problem by refining the estimate of the upper bound on possible solutions.
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 1440453
zbMATH Keywords: separable integer programming
zbMATH Keywords: branch-and-bound method
MaRDI profile type: Publication
Recommended article: Q3325469
Recommended article: A method of solving one class of integer programming problems
Recommended article: Q4789742
Recommended article: Q3801340
Recommended article: Q4705150
Recommended article: An approach to the solution of integer optimization problems
Recommended article: Q3211109
Recommended article: Q3468882
Recommended article: Technical Note—An Improved Branch-and-Bound Method for Integer Programming
Recommended article: A new procedure for solving integer linear programming problems
description: scientific article; zbMATH DE number 1440453