Geodesic
On the stability of some integer programming algorithms
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (2003), pp. 41-48.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{IVM_2003_12_a2,
     author = {M. V. Devyaterikova and A. A. Kolokolov},
     title = {On the stability of some integer programming algorithms},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {41--48},
     publisher = {mathdoc},
     number = {12},
     year = {2003},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_2003_12_a2/}
}
TY  - JOUR
AU  - M. V. Devyaterikova
AU  - A. A. Kolokolov
TI  - On the stability of some integer programming algorithms
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 2003
SP  - 41
EP  - 48
IS  - 12
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_2003_12_a2/
LA  - ru
ID  - IVM_2003_12_a2
ER  - 
%0 Journal Article
%A M. V. Devyaterikova
%A A. A. Kolokolov
%T On the stability of some integer programming algorithms
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 2003
%P 41-48
%N 12
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_2003_12_a2/
%G ru
%F IVM_2003_12_a2
M. V. Devyaterikova; A. A. Kolokolov. On the stability of some integer programming algorithms. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (2003), pp. 41-48. http://geodesic.mathdoc.fr/item/IVM_2003_12_a2/

[1] Sergienko I. V., Kozeratskaya L. N., Lebedeva T. T., Issledovanie ustoichivosti i parametricheskii analiz diskretnykh optimizatsionnykh zadach, Nauk. dumka, Kiev, 1995, 170 pp. | Zbl

[2] Gordeev E. N., Leontev V. K., “Obschii podkhod k issledovaniyu ustoichivosti reshenii v zadachakh diskretnoi optimizatsii”, Zhurn. vychisl. matem. i matem. fiz., 36:1 (1996), 66–72 | MR | Zbl

[3] Emelichev V. A., Podkopaev D. P., “O kolichestvennoi mere ustoichivosti vektornoi zadachi tselochislennogo programmirovaniya”, Zhurn. vychisl. matem. i matem. fiz., 38:11 (1998), 1801–1805 | MR | Zbl

[4] “Sensivity, stability and parametric analysis”, Math. Program. Study, 21:1–6 (1984), 1–242 | MR

[5] Cook W., Gerards A. M. H., Schrijver A., Tardos E., “Sensitivity theorems in integer linear programming”, Math. Program., 34:3 (1986), 251–264 | DOI | MR | Zbl

[6] Wagelmans A. P. M., Sensitivity analysis in combinatorial optimization, Ph. D. dissert., Erasmus Univ., Rotterdam, 1990, 211 pp.

[7] Libura M., “Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems”, Discr. Appl. Math., 1991, no. 30, 197–211 | DOI | MR | Zbl

[8] Chakravarti N., Wagelmans A. P. M., “Calculation of stability radius for combinatorial optimization problems”, Oper. Res. Letters, 1998, no. 23, 1–7 | DOI | MR | Zbl

[9] Kolokolov A. A., Devyaterikova M. V., “Analiz ustoichivosti $L$-razbieniya mnozhestv v konechnomernom prostranstve”, Diskretn. analiz i issledov. operatsii. Ser .2, 7:2 (2000), 47–53 | MR | Zbl

[10] Devyaterikova M. V., Kolokolov A. A., “Analysis of $L$-structure stability of convex integer programming problems”, Oper. Res. Proc., Springer, 2000, 49–54 | MR

[11] Kolokolov A. A., “Primenenie regulyarnykh razbienii v tselochislennom programmirovanii”, Izv. vuzov. Matematika, 1993, no. 12, 11–30 | MR | Zbl

[12] Devyaterikova M. V., Kolokolov A. A., “Ob ustoichivosti nekotorykh algoritmov tselochislennogo programmirovaniya”, Diskretnyi analiz i issledovanie operatsii, Mater. konf., Novosibirsk, 2002, 206

[13] Kolokolov A. A., Devyaterikova M. V., “On stability of some integer programming algorithms”, Intern. Conf. on Oper. Res., Book of abstracts, Klagenfurt, 2002, 99 | MR

[14] Eremeev A. V., Kolokolov A. A., Zaozerskaya L. A., “A hybrid algorithm for set covering problem”, Proc. of Intern. Workshop on Discr. Optim. Methods in Scheduling and Computer-Aided Design, Minsk, 2000, 123–129

[15] Kolokolov A. A., Adelshin A. V., Cheredova Yu. N., “Primenenie $L$-razbieniya k issledovaniyu nekotorykh zadach vypolnimosti”, Tr. 12-i Baikalskoi mezhd. konf. “Metody optimizatsii i ikh prilozheniya”, T. 1, Irkutsk, 2001, 166–171