default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobin Roundy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j20]Retsef Levi, Robin Roundy, Van-Anh Truong, Xinshang Wang:
Provably Near-Optimal Balancing Policies for Multi-Echelon Stochastic Inventory Control Models. Math. Oper. Res. 42(1): 256-276 (2017)- 2015
- [j19]Lucy Gongtao Chen, Lawrence W. Robinson, Robin O. Roundy, Rachel Q. Zhang:
Technical Note - New Sufficient Conditions for (s, S) Policies to be Optimal in Systems with Multiple Uncertainties. Oper. Res. 63(1): 186-197 (2015) - 2011
- [j18]Van-Anh Truong, Robin O. Roundy:
Multidimensional Approximation Algorithms for Capacity-Expansion Problems. Oper. Res. 59(2): 313-327 (2011)
2000 – 2009
- 2008
- [j17]Retsef Levi, Robin Roundy, David B. Shmoys
, Van-Anh Truong:
Approximation Algorithms for Capacitated Stochastic Inventory Control Models. Oper. Res. 56(5): 1184-1199 (2008) - [j16]Retsef Levi, Robin Roundy, David B. Shmoys, Maxim Sviridenko:
A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem. Manag. Sci. 54(4): 763-776 (2008) - 2007
- [j15]Retsef Levi, Martin Pál, Robin Roundy, David B. Shmoys:
Approximation Algorithms for Stochastic Inventory Control Models. Math. Oper. Res. 32(2): 284-302 (2007) - [j14]Retsef Levi, Robin Roundy, David B. Shmoys:
Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models. Math. Oper. Res. 32(4): 821-839 (2007) - 2006
- [j13]Retsef Levi, Robin Roundy, David B. Shmoys:
Primal-Dual Algorithms for Deterministic Inventory Problems. Math. Oper. Res. 31(2): 267-284 (2006) - [c4]Retsef Levi, Robin Roundy, David B. Shmoys:
Provably near-optimal sampling-based algorithms for Stochastic inventory control models. STOC 2006: 739-748 - 2005
- [j12]Rachel R. Chen, Robin O. Roundy, Rachel Q. Zhang, Ganesh Janakiraman:
Efficient Auction Mechanisms for Supply Chain Procurement. Manag. Sci. 51(3): 467-482 (2005) - [j11]Retsef Levi, Martin Pál, Robin O. Roundy, David B. Shmoys, Ravi Subramanian, Xinxin Hu, Gad Allon, Felipe Caro, Holly S. Lutze:
The MSOM Society Student Paper Competition: Extended Abstracts of 2004 Winners. Manuf. Serv. Oper. Manag. 7(1): 81-99 (2005) - [c3]Retsef Levi, Martin Pál, Robin Roundy, David B. Shmoys:
Approximation Algorithms for Stochastic Inventory Control Models. IPCO 2005: 306-320 - [c2]Retsef Levi, Robin Roundy, David B. Shmoys:
A constant approximation algorithm for the one-warehouse multi-retailer problem. SODA 2005: 365-374 - 2004
- [j10]Ganesh Janakiraman, Robin O. Roundy:
Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies. Oper. Res. 52(5): 795-803 (2004) - [c1]Retsef Levi, Robin Roundy, David B. Shmoys:
Primal-dual algorithms for deterministic inventory problems. STOC 2004: 353-362 - 2001
- [j9]Robin O. Roundy, Gennady Samorodnitsky:
Optimal and Near-Optimal ( s, S) Inventory Policies for Levy Demand Processes. RAIRO Oper. Res. 35(1): 37-70 (2001)
1990 – 1999
- 1997
- [j8]Yale T. Herer, Robin Roundy:
Heuristics for a One-Warehouse Multiretailer Distribution Problem with Performance Bounds. Oper. Res. 45(1): 102-115 (1997) - 1994
- [j7]Robin O. Roundy, Daning Sun:
An Improved Algorithm for Finding Optimal Lot Sizing Policies for Finite Production Rate Assembly Systems. Oper. Res. 42(3): 562-565 (1994) - 1993
- [j6]Robin O. Roundy:
Efficient, Effective Lot Sizing for Multistage Production Systems. Oper. Res. 41(2): 371-385 (1993) - [p1]John A. Muckstadt, Robin O. Roundy:
Chapter 2 Analysis of multistage production systems. Logistics of Production and Inventory 1993: 59-131 - 1992
- [j5]Robin Roundy:
Cyclic Schedules for Job Shops with Identical Jobs. Math. Oper. Res. 17(4): 842-865 (1992) - 1991
- [j4]Esther M. Arkin, Robin O. Roundy:
Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights. Oper. Res. 39(1): 64-81 (1991) - [j3]Peter L. Jackson, Robin O. Roundy:
Minimizing Separable Convex Objectives on Arbitrarily Directed Trees of Variable Upper Bound Constraints. Math. Oper. Res. 16(3): 504-533 (1991) - 1990
- [j2]Robin O. Roundy:
Computing Nested Reorder Intervals for Multi-Item Distribution Systems. Oper. Res. 38(1): 37-52 (1990)
1980 – 1989
- 1986
- [j1]Robin Roundy:
A 98%-Effective Lot-Sizing Rule for a Multi-Product, Multi-Stage Production / Inventory System. Math. Oper. Res. 11(4): 699-727 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
