Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Chaithanya Bandi"'
Publikováno v:
Operations Research Letters. 50:399-406
Publikováno v:
Manufacturing and Service Operations Management, 24(1), 561-579. INFORMS Institute for Operations Research and the Management Sciences
Problem definition: We consider the intraday scheduling problem in a group of orthopaedic clinics where the planner schedules appointment times, given a sequence of appointments. We consider patient re-entry—where patients may be required to go for
Autor:
Sagnik Sarkar, Siddhartha Devapujula, Hrishikesh Vidyadhar Ganu, Chaithanya Bandi, Ravindra Babu Tallamraju, Chilamakurthi Vamsikrishna Satya, Siddhant Doshi
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031272493
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c0b9c2b3ae29de30f08470dd463d8154
https://doi.org/10.1007/978-3-031-27250-9_32
https://doi.org/10.1007/978-3-031-27250-9_32
Publikováno v:
Operations Research.
The paper by Han, Bandi, and Nohadani on “On Finite Adaptability in Two-Stage Distributionally Robust Optimization” studies finite adaptability with the goal to construct interpretable and easily implementable policies in the context of two-stage
Publikováno v:
Optimization and Engineering. 22:1557-1588
Given an edge-weighted graph and a subset of the vertices called terminals, the multiway cut problem aims to find a minimum weight set of edges that separates each terminal from all the others. This problem is known to be NP-hard even for $$k=3$$ . C
Publikováno v:
INFORMS Journal on Computing. 33:336-351
We consider a robust optimization problem in an electric power system under uncertain demand and availability of renewable energy resources. Solving the deterministic alternating current (AC) optimal power flow (ACOPF) problem has been considered cha
Autor:
Diwakar Gupta, Chaithanya Bandi
Publikováno v:
Manufacturing & Service Operations Management. 22:958-974
Problem definition: We consider two problems faced by an operating room (OR) manager: (1) how many baseline (core) staff to hire for OR suites, and (2) how to schedule surgery requests that arrive one by one. The OR manager has access to historical c
We introduce a new class of adaptive policies called periodic-affine policies, which allows a decision maker to optimally manage and control large-scale newsvendor networks in the presence of uncertain demand without distributional assumptions. These
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::39ab266068e5a9025e75f6fbf3c3855d
http://arxiv.org/abs/1806.06744
http://arxiv.org/abs/1806.06744
Publikováno v:
other univ website
In this paper, we study systems that allocate different types of scarce resources to heterogeneous allocatees based on predetermined priority rules—the U.S. deceased-donor kidney allocation system or the public housing program. We tackle the proble
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6e3d6c97006b8c27fcb7b3c7253c2537
http://hdl.handle.net/1721.1/120985
http://hdl.handle.net/1721.1/120985
Publikováno v:
Springer US
We propose an analytically tractable approach for studying the transient behavior of multi-server queueing systems and feed-forward networks. We model the queueing primitives via polyhedral uncertainty sets inspired by the limit laws of probability.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9c017a1429f10f689f66b8a382892404
https://hdl.handle.net/1721.1/131913
https://hdl.handle.net/1721.1/131913