Zobrazeno 1 - 10
of 120
pro vyhledávání: '"A. Armaselu"'
Autor:
Armaselu, Bogdan
In this paper, we consider the Maximum-Profit Routing Problem (MPRP), introduced in \cite{Armaselu-PETRA}. In MPRP, the goal is to route the given fleet of vehicles to pickup goods from specified sites in such a way as to maximize the profit, i.e., t
Externí odkaz:
http://arxiv.org/abs/2305.07838
Autor:
Armaselu, Bogdan
We consider the Maximum-Profit Routing Problem (MPRP), a variant of pick-up routing problem introduced in \cite{Armaselu-arXiv-2016, Armaselu-PETRA}, in which the goal is to maximize total profit. The original MPRP restricts vehicles to visit a site
Externí odkaz:
http://arxiv.org/abs/2109.05404
Autor:
Armaselu, Bogdan
In this paper, we study two extensions of the maximum bichromatic separating rectangle (MBSR) problem introduced in \cite{Armaselu-CCCG, Armaselu-arXiv}. One of the extensions, introduced in \cite{Armaselu-FWCG}, is called \textit{MBSR with outliers}
Externí odkaz:
http://arxiv.org/abs/2106.13439
Autor:
Armaselu, Bogdan
We consider the problem of computing the largest-area bichromatic separating box among a set of $n$ red points and a set of $m$ blue points in three dimensions. Currently, the best-known algorithm to solve this problem takes $O(m^2 (m + n))$ time and
Externí odkaz:
http://arxiv.org/abs/2012.12846
Autor:
Armaselu, Bogdan
In this paper, we study the Maximum-Profit Routing Problem with Variable Supply (MPRP-VS). This is a more general version of the Maximum-Profit Public Transportation Route Planning Problem, or simply Maximum-Profit Routing Problem (MPRP), introduced
Externí odkaz:
http://arxiv.org/abs/2007.09282
Autor:
Armaselu, Bogdan, Daescu, Ovidiu
Given a set R of n red points and a set B of m blue points, we study the problem of finding a rectangle that contains all the red points, the minimum number of blue points and has the largest area. We call such rectangle a maximum separating rectangl
Externí odkaz:
http://arxiv.org/abs/1706.03268
Autor:
Armaselu, Bogdan, Daescu, Ovidiu
In this paper, we study the Maximum Profit Pick-up Problem with Time Windows and Capacity Constraint (MP-PPTWC). Our main results are 3 polynomial time algorithms, all having constant approximation factors. The first algorithm has an approximation ra
Externí odkaz:
http://arxiv.org/abs/1612.01038
Autor:
Florentina Armaselu
Publikováno v:
Digital Studies, Vol 12, Iss 1 (2022)
The paper proposes a methodology that combines theoretical and practical aspects from human-computer interaction (HCI) and genetic criticism to trace and analyse prototype evolution. A case study illustrates this type of enquiry by examining the iter
Externí odkaz:
https://doaj.org/article/15e29ca1a8164ea0821a27fc9edc8625
Autor:
Bogdan Armaselu
Publikováno v:
Information, Vol 13, Iss 10, p 476 (2022)
An important topic in the field of geometric optimization is finding the largest rectangle separating two different points sets, which has significant applications in circuit design and data science. We consider some extensions of the maximum bichrom
Externí odkaz:
https://doaj.org/article/66cbdade58f54ab683a33c1cb98fc6a7