This article is cited in 7 papers

Discrete Optimization

Stability analysis of some discrete optimization algorithms

M. V. Devyaterikova, A. A. Kolokolov

Omsk Branch of Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Science

Abstract: Facts established for stability of the relaxation set-based integer programming algorithms were reviewed. For the problem of integer linear programming, the branch-and-bound algorithms were examined for stability within the framework of the Land–Doig method. They were shown to be unstable for sufficiently small oscillations of the relaxation sets of the problems at hand. A similar result was obtained for algorithms with the Dantzig cuts.

Presented by the member of Editorial Board: A. I. Kibzun

Received: 27.06.2003

 English version: Automation and Remote Control, 2004, 65:3, 401–406

Bibliographic databases:

• 
• 
• 
•