RUS  ENG
Full version
JOURNALS // Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics] // Archive
Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2009, Issue 15, Pages 93–98 (Mi vtpmk352)
Methods of Optimization

Convex matrices and linear integer optimization problems

V. V. Grigorieva, A. P. Tizikb, Yu. P. Treskovb

a Moscow State Institute of International Relations (University) of the Ministry for Foreign Affairs of Russia
b Dorodnitsyn Computing Centre of the Russian Academy of Sciences, Moscow

Abstract: So-called convex matrixes are considered. It is proved their absolute unimodular Resolvability of linear integer optimization problems is discussed with a convex matrix of restrictions by a simplex-method and polynomial method.

Keywords: matrix, absolute unimodular property, transportation problem, knapsack problem, polynomial algorithm.

UDC: 519.863

Received: 23.07.2009
Revised: 10.09.2009



Bibliographic databases:

© Steklov Math. Inst. of RAS, 2026