Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
605 1 |
Ultima descărcare din IBN: 2023-09-24 21:33 |
SM ISO690:2012 FONOBEROVA, Maria. On determining the minimum cost flows in dynamic networks. In: Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2006, nr. 1(50), pp. 51-56. ISSN 1024-7696. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica | ||||||
Numărul 1(50) / 2006 / ISSN 1024-7696 /ISSNe 2587-4322 | ||||||
|
||||||
Pag. 51-56 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
The dynamic minimum cost flow problem that generalizes the static one is studied. We assume that the supply and demand function and capacities of edges depend on time. One very important case of the minimum cost flow problem with nonlinear cost functions, defined on edges, that do not depend on flow but depend on time is studied. |
||||||
Cuvinte-cheie dynamic networks, dynamic flows, minimum cost flows. |
||||||
|
Crossref XML Export
<?xml version='1.0' encoding='utf-8'?> <doi_batch version='4.3.7' xmlns='http://www.crossref.org/schema/4.3.7' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.crossref.org/schema/4.3.7 http://www.crossref.org/schema/deposit/crossref4.3.7.xsd'> <head> <doi_batch_id>ibn-41167</doi_batch_id> <timestamp>1717835143</timestamp> <depositor> <depositor_name>Information Society Development Instiute, Republic of Moldova</depositor_name> <email_address>[email protected]</email_address> </depositor> <registrant>Institutul de Matematică şi Informatică al AŞM</registrant> </head> <body> <journal> <journal_metadata> <full_title>Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica</full_title> <issn media_type='print'>10247696</issn> </journal_metadata> <journal_issue> <publication_date media_type='print'> <year>2006</year> </publication_date> <issue>1(50)</issue> </journal_issue> <journal_article publication_type='full_text'><titles> <title>On determining the minimum cost flows in dynamic networks</title> </titles> <contributors> <person_name sequence='first' contributor_role='author'> <given_name>Maria</given_name> <surname>Fonoberova</surname> </person_name> </contributors> <publication_date media_type='print'> <year>2006</year> </publication_date> <pages> <first_page>51</first_page> <last_page>56</last_page> </pages> </journal_article> </journal> </body> </doi_batch>