3 citations · 6 across the 6 of their papers we have counts for
4 papers · 1 filter
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…
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…
Approximation Algorithms for the Maximum Profit Pick-up Problem with Time Windows and Capacity Constraint
Bogdan Armaselu, Ovidiu Daescu
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 const…