Article ID Journal Published Year Pages File Type
1143411 Operations Research Letters 2006 6 Pages PDF
Abstract
In the present paper we develop our approach for studying the stability of integer programming problems. We prove that the L-class enumeration method is stable on integer linear programming problems in the case of bounded relaxation sets [9]. The stability of some cutting plane algorithms is discussed.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On the stability of some integer programming algorithms
Authors
, ,