Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Laura Ciupala"'
Autor:
Laura Ciupala, Adrian Deaconu
Publikováno v:
Mathematics, Vol 9, Iss 9, p 1025 (2021)
There are various situations in which real-world problems can be modeled and solved as minimum flow problems. Sometimes, in these situations, minor data changes may occur, leading to corresponding changes of the networks in which the practical proble
Externí odkaz:
https://doaj.org/article/280de9505d68443292389c1cf79d19cd
Autor:
Adrian Deaconu, Laura Ciupala
Publikováno v:
Mathematics, Vol 8, Iss 9, p 1494 (2020)
The inverse minimum cut problem is one of the classical inverse optimization researches. In this paper, the inverse minimum cut with a lower and upper bounds problem is considered. The problem is to change both, the lower and upper bounds on arcs so
Externí odkaz:
https://doaj.org/article/6b3b3724fefd4bf291bac3c23ce7b061
Publikováno v:
SERIES III - MATEMATICS, INFORMATICS, PHYSICS. 13:343-346
Publikováno v:
SERIES III - MATEMATICS, INFORMATICS, PHYSICS. 13:697-704
An image overlapping algorithm, taking into account certain properties of objects identified in the images (average intensity, movement speed, etc) is proposed. The algorithm minimizes both memory and time complexity and it can be used in various app
Publikováno v:
Bulletin of the Transilvania University of Brasov Series III Mathematics and Computer Science. 61:113-122
Publikováno v:
Bulletin of the Transilvania University of Brasov Series III Mathematics and Computer Science. 61:107-112
Autor:
Adrian Deaconu, Laura Ciupala
Publikováno v:
Mathematics, Vol 9, Iss 1025, p 1025 (2021)
Mathematics
Volume 9
Issue 9
Mathematics
Volume 9
Issue 9
There are various situations in which real-world problems can be modeled and solved as minimum flow problems. Sometimes, in these situations, minor data changes may occur, leading to corresponding changes of the networks in which the practical proble
Autor:
Laura Ciupala, Adrian Deaconu
Publikováno v:
Mathematics
Volume 8
Issue 9
Mathematics, Vol 8, Iss 1494, p 1494 (2020)
Volume 8
Issue 9
Mathematics, Vol 8, Iss 1494, p 1494 (2020)
The inverse minimum cut problem is one of the classical inverse optimization researches. In this paper, the inverse minimum cut with a lower and upper bounds problem is considered. The problem is to change both, the lower and upper bounds on arcs so
Autor:
Laura Ciupala, Eleonor Ciurea
Publikováno v:
Journal of Applied Mathematics and Computing. 15:53-75
First, we present two classes of sequential algorithms for minimum flow problem: decreasing path algorithms and preflow algorithms. Then we describe another approach of the minimum flow problem, that consists of applying any maximum flow algorithm in