3 citations · 6 across the 6 of their papers we have counts for
7 papers
Randomized Algorithm for the Maximum-Profit Routing Problem
Bogdan Armaselu
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…
Maximum-Profit Routing Problem with Multiple Vehicles per Site
Bogdan Armaselu
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 maximi…
Extensions of the Maximum Bichromatic Separating Rectangle Problem
Bogdan Armaselu
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, int…
Improved Algorithm for Computing the Maximum-volume Bichromatic Separating Box
Bogdan Armaselu
We consider the problem of computing the largest-area bichromatic separating box among a set of red points and a set of blue points in three dimensions. Currently, the best…
An APX for the Maximum-Profit Routing Problem with Variable Supply
Bogdan Armaselu
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…
Maximum Area Rectangle Separating Red and Blue Points
Bogdan Armaselu, Ovidiu Daescu
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…