|
Avtomatika i Telemekhanika, 2004, Issue 3, Pages 48–54
(Mi at1539)
|
|
|
|
This article is cited in 7 scientific papers (total 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.
Citation:
M. V. Devyaterikova, A. A. Kolokolov, “Stability analysis of some discrete optimization algorithms”, Avtomat. i Telemekh., 2004, no. 3, 48–54; Autom. Remote Control, 65:3 (2004), 401–406
Linking options:
https://www.mathnet.ru/eng/at1539 https://www.mathnet.ru/eng/at/y2004/i3/p48
|
|