|
|
Vestnik SamGU. Estestvenno-Nauchnaya Ser., 2014, Issue 3(114), Pages 115–120
(Mi vsgu358)
|
|
|
|
Mathematic Modeling
Empirical analysis of approximate algorithms for integer programming, based upon the idea of greedy choice
V. M. Montlevicha, A. N. Ismailovab a Samara State University, Samara, 443011, Russian Federation
b SamaraNIPIneft, Samara, 443010, Russian Federation
(published under the terms of the Creative Commons Attribution 4.0 International License)
Abstract:
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.
Received: 05.04.2013 Revised: 05.04.2013
Citation:
V. M. Montlevich, A. N. Ismailova, “Empirical analysis of approximate algorithms for integer programming, based upon the idea of greedy choice”, Vestnik Samarskogo Gosudarstvennogo Universiteta. Estestvenno-Nauchnaya Seriya, 2014, no. 3(114), 115–120
Linking options:
https://www.mathnet.ru/eng/vsgu358 https://www.mathnet.ru/eng/vsgu/y2014/i3/p115
|
| Statistics & downloads: |
| Abstract page: | 179 | | Full-text PDF : | 88 | | References: | 44 |
|