Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Mircea Parpalea"'
Autor:
Mircea Parpalea
Publikováno v:
Bulletin of the Transilvania University of Brasov Series III Mathematics and Computer Science. 61:157-179
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1b7a6cdb6e1b7241197c1a64b335bfb2
https://doi.org/10.31926/but.mif.2019.12.61.1.13
https://doi.org/10.31926/but.mif.2019.12.61.1.13
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 52:43-53
The paper presents a dynamic solution method for the parametric minimum flow in time-dependent, dynamic network. This approach solves the problem for a special parametric dynamic network with linear lower bound functions of a single parameter. Instea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5448b640a1cabb503dbbbd89569ba556
https://doi.org/10.1051/ita/2018002
https://doi.org/10.1051/ita/2018002
Publikováno v:
Fundamenta Informaticae. 156:125-139
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c94898d5a72ebbc87a754b933e45b1a0
https://doi.org/10.3233/fi-2017-1600
https://doi.org/10.3233/fi-2017-1600
Autor:
Eleonor Ciurea, Mircea Parpalea
Publikováno v:
British Journal of Applied Science & Technology. 13:1-8
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d6873180097c1882bba9cc3568354d3
https://doi.org/10.9734/bjast/2016/22636
https://doi.org/10.9734/bjast/2016/22636
Autor:
Mircea Parpalea, Eleonor Ciurea
Publikováno v:
Applied Mathematics. :3-10
The article presents an approach to the maximum flow problem in parametric networks with linear capacity functions of a single parameter, based on the concept of shortest conditional augmenting directed path. In order to avoid working with piecewise
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0dfd749da50a62a3d56f359e51c2410
https://doi.org/10.4236/am.2013.410a1002
https://doi.org/10.4236/am.2013.410a1002
Autor:
Mircea Parpalea
Publikováno v:
Open Journal of Discrete Mathematics. :116-126
This paper presents an algorithm for solving Bi-criteria Minimum Cost Dynamic Flow (BiCMCDF) problem with continuous flow variables. The approach is to transform a bi-criteria problem into a parametric one by building a single parametric linear cost
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::35046922030c5fe47803f597134a2a41
https://doi.org/10.4236/ojdm.2011.13015
https://doi.org/10.4236/ojdm.2011.13015
Autor:
Ioana Nicolae, Mircea Parpalea, Mihaela Parpalea, Livia Sangeorzan, Angela Repanovici, Roxana Matefi
Publikováno v:
Scopus-Elsevier
The present paper proposes a fractal-like approach to the parametric flow problem, derived from the rules and recursion of generative linguistics. In the same manner in which any sentence can be analysed in terms of "theme" of the sentence (that whic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::305493c6ebb1231e5305516460bbaa66
http://www.scopus.com/inward/record.url?eid=2-s2.0-84959371894&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-84959371894&partnerID=MN8TOARS
