EMPIRICAL ANALYSIS OF APPROXIMATE ALGORITHMS FOR INTEGER PROGRAMMING, BASED UPON THE IDEA OF GREEDY CHOICE


Cite item

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.

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


Copyright (c) 2017 В.М. Монтлевич, А.Н. Исмаилова

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies