Geodesic
Empirical analysis of approximate algorithms for integer programming, based upon the idea of greedy choice
Vestnik Samarskogo universiteta. Estestvennonaučnaâ seriâ, no. 3 (2014), pp. 115-120 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The article contains the results of empirical studies of heuristic algorithms for integer programming based upon the idea of greedy choice. On the base of numerous computer experiments estimate of average level of inaccuracy of approximate solution are presented.
Keywords: integer programming, algorithm, heuristics, greedy choice, inaccuracy. 
@article{VSGU_2014_3_a11,
     author = {V. M. Montlevich and A. N. Ismailova},
     title = {Empirical analysis of approximate algorithms for integer programming, based upon the idea of greedy choice},
     journal = {Vestnik Samarskogo universiteta. Estestvennonau\v{c}na\^a seri\^a},
     pages = {115--120},
     year = {2014},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VSGU_2014_3_a11/}
}
TY  - JOUR
AU  - V. M. Montlevich
AU  - A. N. Ismailova
TI  - Empirical analysis of approximate algorithms for integer programming, based upon the idea of greedy choice
JO  - Vestnik Samarskogo universiteta. Estestvennonaučnaâ seriâ
PY  - 2014
SP  - 115
EP  - 120
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/VSGU_2014_3_a11/
LA  - ru
ID  - VSGU_2014_3_a11
ER  - 
%0 Journal Article
%A V. M. Montlevich
%A A. N. Ismailova
%T Empirical analysis of approximate algorithms for integer programming, based upon the idea of greedy choice
%J Vestnik Samarskogo universiteta. Estestvennonaučnaâ seriâ
%D 2014
%P 115-120
%N 3
%U http://geodesic.mathdoc.fr/item/VSGU_2014_3_a11/
%G ru
%F VSGU_2014_3_a11
V. M. Montlevich; A. N. Ismailova. Empirical analysis of approximate algorithms for integer programming, based upon the idea of greedy choice. Vestnik Samarskogo universiteta. Estestvennonaučnaâ seriâ, no. 3 (2014), pp. 115-120. http://geodesic.mathdoc.fr/item/VSGU_2014_3_a11/

[1] Glebov N., Shenmaier V., “On the application of algorithms of coordinate rise for integer programming problems”, Diskretnyi analiz i issledovanie operatsii. Series 1, 7:4 (2000), 38–47 | MR

[2] Glebov N., “On conditions of solvability of optimization problems using greedy algorithms”, Diskretnyi analiz i issledovanie operatsii. Series 2, 9:2, July–December (2002), 3–12 | MR

[3] Shenmaier V., “Maximization of linear form using greedy algorithms”, Diskretnyi analiz i issledovanie operatsii. Series 1, 6:4 (1999), 104–120 | MR