Analysis of integer programming algorithms with L-partition and unimodular transformations

Authors:
A. A. Kolokolov;T. G. Orlovskaya;M. F. Rybalka
Affiliations:
Omsk Affiliated Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Omsk, Russia;Omsk Affiliated Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Omsk, Russia;Omsk Affiliated Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Omsk, Russia
Venue:
Automation and Remote Control
Year:
2012

Citing 6
Cited 0

Polytopes, graphs and optimisation

Polytopes, graphs and optimisation
Theory of linear and integer programming

Theory of linear and integer programming
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Branch and Cut solver for the maximum stable set problem

Journal of Combinatorial Optimization
Column basis reduction and decomposable knapsack problems

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study algorithms for solving integer linear programming problems, in particular, set packing and knapsack problems. We pay special attention to algorithms of lexicographic enumeration of L-classes and their combinations with other approaches. We study the problems of using unimodular transformations in order to improve the structure of the problems and speed up the algorithms. We construct estimates on the number of iterations for the algorithms that take into account the specific structure of the problems in question. We also show experimental results.