( en | de | ru )

 

Disambiguation of "Armaselu, Bogdan"

Author of the publication

copydeleteadd this publication to your clipboard
Approximation Algorithms for the Maximum Profit Pick-up Problem with Time Windows and Capacity Constraint.

, and . CoRR, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Alina Bogdan

Bogdan Bernevic

Ingrid Bogdan

Bogdan Nowakowski

Bogdan Bogdanow

 

Other publications of authors with the same name

Improved Algorithm for Computing the Maximum-volume Bichromatic Separating Box.. CoRR, (2020)Interactive Assistive Framework for Maximum Profit Routing in Public Transportation in Smart Cities., and . PETRA, page 13-16. ACM, (2017)Extensions of the Maximum Bichromatic Separating Rectangle Problem.. CCCG, page 237-247. (2021)Dynamic Minimum Bichromatic Separating Circle., and . COCOA, volume 9486 of Lecture Notes in Computer Science, page 688-697. Springer, (2015)Approximation algorithms for the Vehicle Routing Problem with Time Windows, Capacity Constraint and Unlimited Number of Vehicles: Poster Paper., and . PETRA, page 75. ACM, (2016)Dynamic minimum bichromatic separating circle., and . Theor. Comput. Sci., (2019)Computer Aided Image Segmentation and Classification for Viable and Non-Viable Tumor Identification in Osteosarcoma., , , , , , , , , and . PSB, page 195-206. (2017)Algorithms for Fair Partitioning of Convex Polygons., and . COCOA, volume 8881 of Lecture Notes in Computer Science, page 53-65. Springer, (2014)Approximation Algorithms for the Maximum Profit Pick-up Problem with Time Windows and Capacity Constraint., and . CoRR, (2016)Algorithms for fair partitioning of convex polygons., and . Theor. Comput. Sci., (2015)