# Robin Roundy

According to our database

Collaborative distances:

^{1}, Robin Roundy authored at least 24 papers between 1986 and 2017.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2017

Provably Near-Optimal Balancing Policies for Multi-Echelon Stochastic Inventory Control Models.

Math. Oper. Res., 2017

2015

Technical Note - New Sufficient Conditions for (

*s, S*) Policies to be Optimal in Systems with Multiple Uncertainties.
Operations Research, 2015

2011

Multidimensional Approximation Algorithms for Capacity-Expansion Problems.

Operations Research, 2011

2008

A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem.

Management Science, 2008

Approximation Algorithms for Capacitated Stochastic Inventory Control Models.

Operations Research, 2008

2007

Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models.

Math. Oper. Res., 2007

Approximation Algorithms for Stochastic Inventory Control Models.

Math. Oper. Res., 2007

2006

Primal-Dual Algorithms for Deterministic Inventory Problems.

Math. Oper. Res., 2006

Provably near-optimal sampling-based algorithms for Stochastic inventory control models.

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

2005

The MSOM Society Student Paper Competition: Extended Abstracts of 2004 Winners.

Manufacturing & Service Operations Management, 2005

Efficient Auction Mechanisms for Supply Chain Procurement.

Management Science, 2005

A constant approximation algorithm for the one-warehouse multi-retailer problem.

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Approximation Algorithms for Stochastic Inventory Control Models.

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2004

Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies.

Operations Research, 2004

Primal-dual algorithms for deterministic inventory problems.

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

2001

Optimal and Near-Optimal (

*s, S*) Inventory Policies for Levy Demand Processes.
RAIRO - Operations Research, 2001

1997

Heuristics for a One-Warehouse Multiretailer Distribution Problem with Performance Bounds.

Operations Research, 1997

1994

An Improved Algorithm for Finding Optimal Lot Sizing Policies for Finite Production Rate Assembly Systems.

Operations Research, 1994

1993

Efficient, Effective Lot Sizing for Multistage Production Systems.

Operations Research, 1993

1992

Cyclic Schedules for Job Shops with Identical Jobs.

Math. Oper. Res., 1992

1991

Minimizing Separable Convex Objectives on Arbitrarily Directed Trees of Variable Upper Bound Constraints.

Math. Oper. Res., 1991

Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights.

Operations Research, 1991

1990

Computing Nested Reorder Intervals for Multi-Item Distribution Systems.

Operations Research, 1990

1986

A 98%-Effective Lot-Sizing Rule for a Multi-Product, Multi-Stage Production / Inventory System.

Math. Oper. Res., 1986