Author of the publication

Supply Chain Management with Online Customer Selection.

, and . Operations Research, 64 (2): 458-473 (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.

 

Other publications of authors with the same name

A constant approximation algorithm for the one-warehouse multi-retailer problem., , and . SODA, page 365-374. SIAM, (2005)Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences., , and . Operations Research, 66 (5): 1321-1345 (2018)LP-based Approximation Algorithms for Capacitated Facility Location., , and . IPCO, volume 3064 of Lecture Notes in Computer Science, page 206-218. Springer, (2004)Approximation Algorithms for Capacitated Stochastic Inventory Control Models., , , and . Oper. Res., 56 (5): 1184-1199 (2008)Primal-Dual Algorithms for Deterministic Inventory Problems., , and . Math. Oper. Res., 31 (2): 267-284 (2006)Supply Chain Management with Online Customer Selection., and . Operations Research, 64 (2): 458-473 (2016)Scheduling with Testing., , and . Manag. Sci., 65 (2): 776-793 (2019)Provably Near-Optimal LP-Based Policies for Revenue Management in Systems with Reusable Resources., and . Operations Research, 58 (2): 503-507 (2010)Online make-to-order joint replenishment model: primal dual competitive algorithms., , , , and . SODA, page 952-961. SIAM, (2008)Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs., , , , , and . ACM Trans. Algorithms, 4 (3): 34:1-34:17 (2008)