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, Issue 3(114),Pages <nobr>115

Mathematic Modeling

Empirical analysis of approximate algorithms for integer programming, based upon the idea of greedy choice

V. M. Montlevich^a, A. N. Ismailova^b

^a Samara State University, Samara, 443011, Russian Federation
^b SamaraNIPIneft, Samara, 443010, Russian Federation

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.

UDC: 519.8

Received: 05.04.2013
Revised: 05.04.2013