Estimation of the number of iterations in integer programming algorithms using the regular partitions method

We review the results of studying integer linear programming algorithms which exploit properties of problem relaxation sets. The main attention is paid to the estimation of the number of iterations of these algorithms by means of the regular partitions method and other approaches. We present such es...

Full description

Bibliographic Details

Published in:	Russian mathematics Vol. 58; no. 1; pp. 35 - 46
Main Authors:	Kolokolov, A. A., Zaozerskaya, L. A.
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.01.2014
Subjects:	Mathematics Mathematics and Statistics integer programming estimates of the number of iterations regular partitions method discrete optimization branch and bound method L-class enumeration stability of algorithms estimates on average cuts
ISSN:	1066-369X, 1934-810X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!