Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

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

Diskretnyi Analiz i Issledovanie Operatsii, 2011, Volume 18, Issue 5, Pages 3–10 (Mi da662)  
This article is cited in 1 scientific paper (total in 1 paper)

Multicriterial graph problems with MAXMIN criterion

V. G. Vizing

Odessa, Ukraine
Full-text PDF (242 kB) Citations (1)
References:
PDF
HTML
Abstract: $r$-Criterial problems for $r$-weighted graphs are considered $(r\geq2)$. Certain kinds of subgraphs are called admissible. To solve problem means to choose a Pareto optimal admissible subgraph from the complete set of alternatives (CSA). The main result of this paper is following. Suppose that a criterion, denoted by MAXMIN, requires maximization of the minimal first edges' weight of the admissible subgraph and there is an effective procedure constructing the CSA for a $(r-1)$-criterial problem without this MAXMIN criterion. Then the CSA for the initial $r$-criterial problem is created effectively. Bibliogr. 11.
Keywords: admissible subgraph, indicator of subgraph's quality, Pareto optimal subgraph.
Received: 17.05.2011
English version:
Journal of Applied and Industrial Mathematics, 2012, Volume 6, Issue 2, Pages 256–260
DOI: https://doi.org/10.1134/S1990478912020159
Bibliographic databases:
Document Type: Article
UDC: 519.718
Language: Russian
Citation: V. G. Vizing, “Multicriterial graph problems with MAXMIN criterion”, Diskretn. Anal. Issled. Oper., 18:5 (2011), 3–10; J. Appl. Industr. Math., 6:2 (2012), 256–260
Citation in format AMSBIB
\Bibitem{Viz11}
\by V.~G.~Vizing
\paper Multicriterial graph problems with MAXMIN criterion
\jour Diskretn. Anal. Issled. Oper.
\yr 2011
\vol 18
\issue 5
\pages 3--10
\mathnet{http://mi.mathnet.ru/da662}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2918326}
\zmath{https://zbmath.org/?q=an:1249.90303}
\transl
\jour J. Appl. Industr. Math.
\yr 2012
\vol 6
\issue 2
\pages 256--260
\crossref{https://doi.org/10.1134/S1990478912020159}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84861790301}
Linking options:
  • https://www.mathnet.ru/eng/da662
  • https://www.mathnet.ru/eng/da/v18/i5/p3
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:428
    Full-text PDF :134
    References:37
    First page:7
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024