| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 1127 3 |
| Ultima descărcare din IBN: 2017-02-26 08:05 |
| Căutarea după subiecte similare conform CZU |
| 519.1 (116) |
| Analiză combinatorică. Teoria grafurilor (114) |
 SM ISO690:2012LOZOVANU, Dmitrii. Determining the Optimal Paths in Networks
with Rated Transition Time Costs. In: Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2014, nr. 1(74), pp. 14-22. ISSN 1024-7696. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica |
||||||
| Numărul 1(74) / 2014 / ISSN 1024-7696 /ISSNe 2587-4322 | ||||||
|
||||||
| CZU: 519.1 | ||||||
| Pag. 14-22 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
We formulate and study the problem of determining the optimal paths in networks with rated transition time costs on edges. Polynomial time algorithms for determining the optimal solution of this problem are proposed and grounded. The proposed algorithms generalize algorithms for determining the optimal paths in the
weighted directed graphs. |
||||||
| Cuvinte-cheie networks, Optimal paths, Time transition cost, Total rated cost, Polynomial Time Algorithm |
||||||
|
Google Scholar Export
<meta name="citation_title" content="Determining the Optimal Paths in Networks with Rated Transition Time Costs"> <meta name="citation_author" content="Lozovanu Dmitrii"> <meta name="citation_publication_date" content="2014/02/04"> <meta name="citation_journal_title" content="Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica"> <meta name="citation_volume" content="74"> <meta name="citation_issue" content="1"> <meta name="citation_firstpage" content="14"> <meta name="citation_lastpage" content="22"> <meta name="citation_pdf_url" content="https://ibn.idsi.md/sites/default/files/imag_file/Determining%20the%20Optimal%20Paths%20in%20Networks%20with%20Rated%20Transition%20Time%20Costs.pdf">
|
|
|
