Zobrazeno 1 - 10
of 90
pro vyhledávání: '"Viswanath Nagarajan"'
Autor:
Rohan Ghuge, Viswanath Nagarajan
Publikováno v:
Mathematics of Operations Research. 47:1612-1630
We consider the following general network design problem. The input is an asymmetric metric (V, c), root [Formula: see text], monotone submodular function [Formula: see text], and budget B. The goal is to find an r-rooted arborescence T of cost at mo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b07cf0a87407428303a5404e9d970fe3
https://doi.org/10.1287/moor.2021.1181
https://doi.org/10.1287/moor.2021.1181
Publikováno v:
Operations Research. 70:786-804
Assortment optimization involves selecting a subset of products to offer to customers in order to maximize revenue. Often, the selected subset must also satisfy some constraints, such as capacity or space usage. Two key aspects in assortment optimiza
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10a603a57d208f8210eed5671dd2eb6f
https://doi.org/10.1287/opre.2021.2188
https://doi.org/10.1287/opre.2021.2188
Publikováno v:
INFORMS Journal on Computing. 34:953-973
We consider a variant of the vehicle routing problem (VRP) where each customer has a unit demand and the goal is to minimize the total cost of routing a fleet of capacitated vehicles from one or multiple depots to visit all customers. We propose two
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c4f3360c29d1225a9f409dfc1eeb01c
https://doi.org/10.1287/ijoc.2021.1105
https://doi.org/10.1287/ijoc.2021.1105
Autor:
Viswanath Nagarajan, Lily Wang
Publikováno v:
Mathematics of Operations Research.
We consider a general online network design problem where a sequence of N requests arrive over time, each of which needs to use some subset of the available resources E. The cost incurred by any resource e is some function $f_e$ of the total load $L_
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6213bf0ea7e7fab32dc10311f9acb44
https://doi.org/10.1287/moor.2022.1349
https://doi.org/10.1287/moor.2022.1349
Autor:
Yubing Cui, Viswanath Nagarajan
Publikováno v:
Symposium on Simplicity in Algorithms (SOSA) ISBN: 9781611977585
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7ed409ee3822f88b55a353e91d0678de
https://doi.org/10.1137/1.9781611977585.ch2
https://doi.org/10.1137/1.9781611977585.ch2
Publikováno v:
Operations Research.
In the stochastic submodular cover problem, the goal is to select a subset of stochastic items of minimum expected cost to cover a submodular function. Solutions in this setting correspond to sequential decision processes that select items one by one
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b91623c42863a3785fc541780c06d135
https://doi.org/10.1287/opre.2022.2388
https://doi.org/10.1287/opre.2022.2388
Publikováno v:
Navidi, F, Gørtz, I L & Nagarajan, V 2020, ' Approximation algorithms for the a priori traveling repairman ', Operations Research Letters, vol. 48, no. 5, pp. 599-606 . https://doi.org/10.1016/j.orl.2020.07.009
We consider the a priori traveling repairman problem, which is a stochastic version of the classic traveling repairman problem. Given a metric ( V , d ) with a root r ∈ V , the traveling repairman problem (TRP) involves finding a tour originating f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eefaa7b2a5acf2a05848a65b40f39a79
https://doi.org/10.1016/j.orl.2020.07.009
https://doi.org/10.1016/j.orl.2020.07.009
Publikováno v:
Mathematics of Operations Research. 45:1-14
The [Formula: see text]-supplier problem is a fundamental location problem that involves opening [Formula: see text] facilities to minimize the maximum distance of any client to an open facility. We consider the [Formula: see text]-supplier problem i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5f5d6ea7cace1e02325590448597988
https://doi.org/10.1287/moor.2018.0953
https://doi.org/10.1287/moor.2018.0953
Autor:
Viswanath Nagarajan, Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Cliff Stein, Kirk Pruhs
Publikováno v:
SIAM Journal on Computing. 49:37-66
We consider virtual circuit routing protocols with an objective of minimizing energy in a network of components that are speed scalable, and that may be shut down when idle. We assume the standard ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c14120ff36f7c8905af53e1064c73aac
https://doi.org/10.1137/18m1228591
https://doi.org/10.1137/18m1228591
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783031069000
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::51b4500cdbadfb350fd8dde46153e591
https://doi.org/10.1007/978-3-031-06901-7_21
https://doi.org/10.1007/978-3-031-06901-7_21