Zobrazeno 1 - 10
of 1 723
pro vyhledávání: '"KANT, RAVI"'
This article discusses the single Depot multiple Set Orienteering Problem (sDmSOP), a recently suggested generalization of the Set Orienteering Problem (SOP). This problem aims to discover a path for each traveler over a subset of vertices, where eac
Externí odkaz:
http://arxiv.org/abs/2411.12300
Autor:
Qu, Yanlin, Kant, Ravi, Chen, Yan, Kitts, Brendan, Gultekin, San, Flores, Aaron, Blanchet, Jose
Bid shading has become a standard practice in the digital advertising industry, in which most auctions for advertising (ad) opportunities are now of first price type. Given an ad opportunity, performing bid shading requires estimating not only the va
Externí odkaz:
http://arxiv.org/abs/2410.14864
Publikováno v:
Journal of Medical Sciences and Health, Vol 6, Iss 3, Pp 74-78 (2021)
Externí odkaz:
https://doaj.org/article/81531c5ccd6c45e494c18faf30a74229
This paper introduces a variant of the Set Orienteering Problem (SOP), the multi-Depot multiple Set Orienteering Problem (mDmSOP). It generalizes the SOP by grouping nodes into mutually exclusive sets (clusters) with associated profits. Profit can be
Externí odkaz:
http://arxiv.org/abs/2408.08922
Autor:
Kumbhani, Chandresh, Kant, Ravi
Publikováno v:
Journal of Advances in Management Research, 2024, Vol. 21, Issue 5, pp. 805-836.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/JAMR-03-2024-0103
This paper presents the plan of an in-pipe climbing robot that works utilizing an astute transmission part to investigate complex relationship of lines. Standard wheeled/proceeded in-pipe climbing robots are inclined to slip and take while investigat
Externí odkaz:
http://arxiv.org/abs/2205.09973
Publikováno v:
In Physics and Chemistry of the Earth December 2024 136