RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretn. Anal. Issled. Oper., Ser. 1, 2001, Volume 8, Number 3, Pages 15–25 (Mi da223)  

This article is cited in 1 scientific paper (total in 1 paper)

On the description of a class of problems solvable by a coordinate-wise ascent algorithm

N. I. Glebov

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences

Abstract: In an earlier paper we obtained sufficient conditions for the solvability of some integer programming problems by a coordinatewise-ascent algorithm. In the case of the specification of the set of admissible solutions of the problem by systems of linear inequalities with nonnegative integer coefficients, these conditions can be expressed in terms of the properties of some families of sets closely associated with the structure of the system of linear constraints and with the objective function of the problem. In the present paper we give a more complete description (characterization) of these families of sets, based on a special form of representability of these families by parallel-sequential networks.

Full text: PDF file (1237 kB)

Bibliographic databases:
UDC: 519.8
Received: 09.06.2001

Citation: N. I. Glebov, “On the description of a class of problems solvable by a coordinate-wise ascent algorithm”, Diskretn. Anal. Issled. Oper., Ser. 1, 8:3 (2001), 15–25

Citation in format AMSBIB
\Bibitem{Gle01}
\by N.~I.~Glebov
\paper On the description of a~class of problems solvable by a~coordinate-wise ascent algorithm
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 2001
\vol 8
\issue 3
\pages 15--25
\mathnet{http://mi.mathnet.ru/da223}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1859849}
\zmath{https://zbmath.org/?q=an:1039.90043}


Linking options:
  • http://mi.mathnet.ru/eng/da223
  • http://mi.mathnet.ru/eng/da/v8/s1/i3/p15

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. N. I. Glebov, “Ob usloviyakh razreshimosti optimizatsionnykh zadach zhadnym algoritmom”, Diskretn. analiz i issled. oper., ser. 2, ser. 2, 9:2 (2002), 3–12  mathnet  mathscinet  zmath
  • Дискретный анализ и исследование операций
    Number of views:
    This page:187
    Full text:61

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020