Laura Ciupala
Laura Ciupala has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Adrian Marius Deaconu
Department of Mathematics and Computer Science, Faculty of Mathematics and Computer Science, Transilvania University of Brasov, 50003 Brașov, Romania
3 shared publications - Delia Elena Spridon
Department of Mathematics and Computer Science, Faculty of Mathematics and Computer Science, Transilvania University of Brasov, 50003 Brașov, Romania
1 shared publication
Latest Publications
- Open Access
- 1 May 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (9) , 1025
Incremental Minimum Flow Algorithms
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 problems are modeled as flow problems, such as slight variations in capacity or lower bound. For instance, the capacity or the lower bound of an arc may increase or decrease in time, leaving one with no other choice than finding the new minimum network flow. Given both the various ways in which the networks can be changed and the high frequency of these changes, it is desirable to find as fast a computation method for minimum flow as possible. This paper is focused on the cases that concern increasing and decreasing the capacity or the lower bound of an arc. For these cases, both the minimum flow algorithms and the dynamic minimum flow algorithms that are already known are inefficient. Our incremental algorithms for determining minimum flow in the modified network are more efficient than both the above-mentioned types of algorithms. The proposed method starts from the initial network minimum flow and solves the minimum flow problem in a significantly faster way than recalculating the new network minimum flow starting from scratch.
- 1 May 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (9) , 1025
Open AccessIncremental Minimum Flow Algorithms
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 problems are modeled as flow problems, such as slight variations in capacity or lower bound. For instance, the capacity or the lower bound of an arc may increase or decrease in time, leaving one with no other choice than finding the new minimum network flow. Given both the various ways in which the networks can be changed and the high frequency of these changes, it is desirable to find as fast a computation method for minimum flow as possible. This paper is focused on the cases that concern increasing and decreasing the capacity or the lower bound of an arc. For these cases, both the minimum flow algorithms and the dynamic minimum flow algorithms that are already known are inefficient. Our incremental algorithms for determining minimum flow in the modified network are more efficient than both the above-mentioned types of algorithms. The proposed method starts from the initial network minimum flow and solves the minimum flow problem in a significantly faster way than recalculating the new network minimum flow starting from scratch.
- Open Access
- 3 September 2020
- Published by MDPI AG in Mathematics
- Vol. 8 (9) , 1494
Inverse Minimum Cut Problem with Lower and Upper Bounds
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 that a given feasible cut becomes a minimum cut in the modified network and the distance between the initial vector of bounds and the modified one is minimized. A strongly polynomial algorithm to solve the problem under norm is developed.- 3 September 2020
- Published by MDPI AG in Mathematics
- Vol. 8 (9) , 1494
Open AccessInverse Minimum Cut Problem with Lower and Upper Bounds
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 that a given feasible cut becomes a minimum cut in the modified network and the distance between the initial vector of bounds and the modified one is minimized. A strongly polynomial algorithm to solve the problem under norm is developed.