| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 626 2 |
| Ultima descărcare din IBN: 2024-03-03 19:22 |
 SM ISO690:2012POŞ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. |
||||||
|
DataCite XML Export
<?xml version='1.0' encoding='utf-8'?> <resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'> <creators> <creator> <creatorName>Poştaru, A.</creatorName> <affiliation>Universitatea de Stat din Moldova, Moldova, Republica</affiliation> </creator> <creator> <creatorName>Moftuleac, D.</creatorName> <affiliation>Universitatea de Stat din Moldova, Moldova, Republica</affiliation> </creator> </creators> <titles> <title xml:lang='ro'>O problemă despre centrul probabilist al arborelui</title> </titles> <publisher>Instrumentul Bibliometric National</publisher> <publicationYear>2008</publicationYear> <relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1857-2073</relatedIdentifier> <dates> <date dateType='Issued'>2008-04-01</date> </dates> <resourceType resourceTypeGeneral='Text'>Journal article</resourceType> <descriptions> <description xml:lang='en' descriptionType='Abstract'>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.</description> </descriptions> <formats> <format>application/pdf</format> </formats> </resource>
|
|
|
