Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
628 2 |
Ultima descărcare din IBN: 2024-03-03 19:22 |
SM ISO690:2012 POŞTARU, Andrei, MOFTULEAC, Daniela. O problemă despre centrul probabilist al arborelui. In: Studia Universitatis Moldaviae (Seria Ştiinţe Exacte şi Economice), 2008, nr. 8(18), pp. 33-37. ISSN 1857-2073. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Studia Universitatis Moldaviae (Seria Ştiinţe Exacte şi Economice) | ||||||
Numărul 8(18) / 2008 / ISSN 1857-2073 /ISSNe 2345-1033 | ||||||
|
||||||
Pag. 33-37 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
In this paper we consider the weighted minimax (1-center) location problem on the tree with uniform distributed weights. The set of the T-centres and one algorithm of a
nding of the center of a tree with constant wieghteds is described. |
||||||
|
Dublin Core Export
<?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'> <dc:creator>Poştaru, A.</dc:creator> <dc:creator>Moftuleac, D.</dc:creator> <dc:date>2008-04-01</dc:date> <dc:description xml:lang='en'>In this paper we consider the weighted minimax (1-center) location problem on the tree with uniform distributed weights. The set of the T-centres and one algorithm of a nding of the center of a tree with constant wieghteds is described.</dc:description> <dc:source>Studia Universitatis Moldaviae (Seria Ştiinţe Exacte şi Economice) 18 (8) 33-37</dc:source> <dc:title>O problemă despre centrul probabilist al arborelui</dc:title> <dc:type>info:eu-repo/semantics/article</dc:type> </oai_dc:dc>