Investigation of integer programming problems by means of unimodular transformations and regular partitions
A. A. Kolokolov, T. G. Orlovskaya
Omsk Branch of Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Investigations of questions in integer linear programming are carried out concerned with the joint application of unimodular transformations and the method of regular partitions for changing the structure of problems and increasing the efficiency of algorithms. Main results are obtained for the knapsack problem and some of its generalizations based on an $L$-partition. Families of problems with $L$-coverings of exponential cardinality are presented, and unimodular transformations that improve their structure are constructed. New estimates for the number of iterations are described for $L$-class enumeration algorithms.
integer programming, unimodular transformation, regular partition, $L$-partition, $L$-class enumeration algorithm.
PDF file (186 kB)
A. A. Kolokolov, T. G. Orlovskaya, “Investigation of integer programming problems by means of unimodular transformations and regular partitions”, Trudy Inst. Mat. i Mekh. UrO RAN, 19, no. 2, 2013, 193–202
Citation in format AMSBIB
\by A.~A.~Kolokolov, T.~G.~Orlovskaya
\paper Investigation of integer programming problems by means of unimodular transformations and regular partitions
\serial Trudy Inst. Mat. i Mekh. UrO RAN
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|