Abstract
A number of results in integer programming (IP) were obtained on the basis of regular partitions [1,3,4]. These results include bounds on the number of iterations of dual fractional cutting plane and branch and bound algorithms, development of new L-class enumeration algorithms for analysis and solving of IP problems, etc. Analysis of the integer programming problems stability is a new application of the approach [1,4]. Unlike the authors of [2,5,6] and other papers we study do not only the conditions of stability of optimal solutions, but also the stability of relaxation set of the problems. These questions are investigated here for the convex integer programming problems on the basis of L-partition. New properties of L-structure of the relaxation set are obtained. Upper bounds on cardinalities of the L-intervals are constructed under small enough variations of this set. Here we develop further the results presented in [1,4]. A similar bound on cardinality of L-covering (which is a special case of L-interval) has been obtained in [4].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. G. Busacker, T. L. Saaty (1965). Finite graphs and networks: an introduction with applications. New York: Mc Graw Hill Book Company. XIV, 294 p.
J. Edmonds, E. L. Johnson (1970) Matching: a well solvable class of integer linear programs. In Combinatorial Structures and their Applications, Gordon and Breach, New York, 89–92.
E. Kh. Gimadi, N. I. Glebov, and V. A. Perepelitsa (1976) Algorithms with estimates for discrete optimization problems (in Russian), in: Problemy Kibernet. Vol. 31, Nauka, Moscow, pp. 35–42.
S. Hakimi (1962). On the readability of a set of integers as degrees of the vertices of a graph. J. SIAM Appl. Mathg., 10, 496–506.
F. Harary (1969). Graph theory. Addison-Wesley, Reading, Massachusetts.
V. Havel (1955). A note to question of existence of finite graphs. Casopis Pest Mat., 80, 477–480.
A. V. Kostochka, A. I. Serdyukov (1985) Polynomial algorithms with estimates 3/4 5/6 for the maximum-weight traveling salesman problem (in Russian) Upravlyaemye sistemy, 26, 55–59.
A. I. Serdyukov (1991). Polynomial algorithms with estimates of accuracy of solutions for one class of the maximum weight TSP (in Russian). Kombinator.-algebr. metody v diskret, optimiz. Mezhvuzovskii sbornik. N. Novgorod, 107–114.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Devyaterikova, M.V., Kolokolov, A.A. (2001). Analysis of L-Structure Stability of Convex Integer Programming Problems. In: Fleischmann, B., Lasch, R., Derigs, U., Domschke, W., Rieder, U. (eds) Operations Research Proceedings. Operations Research Proceedings, vol 2000. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56656-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-56656-1_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41587-9
Online ISBN: 978-3-642-56656-1
eBook Packages: Springer Book Archive