Email this article 
EMPIRICAL ANALYSIS OF APPROXIMATE ALGORITHMS FOR INTEGER PROGRAMMING, BASED UPON THE IDEA OF GREEDY CHOICE
- Authors: Montlevich V.1, Ismailova A.2
-
Affiliations:
- Samara State University
- SamaraNIPIneft
- Issue: Vol 20, No 3 (2014)
- Pages: 115-120
- Section: Articles
- URL: https://journals.ssau.ru/est/article/view/4572
- DOI: https://doi.org/10.18287/2541-7525-2014-20-3-115-120
- ID: 4572
Cite item
Full Text
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.
| 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
About the authors
V.M. Montlevich
Samara State University
Author for correspondence.
Email: morenov.sv@ssau.ru
A.N. Ismailova
SamaraNIPIneft
Email: morenov.sv@ssau.ru
References
Supplementary files
