- Approximation Algorithms for Facility Location David B. Shmoys
- Algorithms for the Universal and A Priori TSP Frans Schalekamp
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- Combinatorics in Computer Science Department of Computer Science,
- Inventory and Facility Location Models with Market Retsef Levi #1 , Joseph Geunes ##2 , H. Edwin Romeijn # # #3 , and David B. Shmoys +4
- IMPROVED APPROXIMATION ALGORITHMS FOR THE UNCAPACITATED FACILITY LOCATION PROBLEM
- A constant approximation algorithm for the a priori traveling salesman problem
- Approximation Algorithms for Stochastic Inventory Control Retsef Levi
- An Approximation Scheme for Stochastic Linear Programming and its Application to Stochastic Integer Programs
- OPERATIONS RESEARCH Vol. 56, No. 5, SeptemberOctober 2008, pp. 11841199
- MANAGEMENT SCIENCE Vol. 54, No. 4, April 2008, pp. 763776
- Primal-Dual Algorithms for Deterministic Inventory Problems Retsef Levi
- Curriculum Vitae David B. Shmoys
- Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models
- Samplingbased Approximation Algorithms for Multistage Stochastic Optimization
- A constantfactor approximation algorithm for the kmedian problem
- Fault-Tolerant Facility Location CHAITANYA SWAMY
- Approximation Algorithms for 2-Stage Stochastic Scheduling Problems
- A 3approximation algorithm for the klevel uncapacitated facility location problem
- Approximation algorithms for 2stage stochastic optimization problems
- Lagrangian relaxation for the kmedian problem: new insights and continuity properties
- Computational Complexity D.B. Shmoys and '
- A New Approach to Computing Optimal Schedules for the JobShop Scheduling Problem
- Proceedings of Symposia in Applied Mathematics The Design and Analysis of Approximation Algorithms
- Facility Location with Service Installation Costs (Extended Abstract)
- Primal-Dual Schema for Capacitated Covering Tim Carnes and David Shmoys
- LPbased Approximation Algorithms for Capacitated Facility Location
- Using Linear Programming in the Design and Analysis of Approximation Algorithms
- Approximation algorithms for precedenceconstrained scheduling problems on parallel machines that run at different speeds
- Scheduling to Minimize Average Completion Time: Offline and Online Approximation Algorithms
- Scheduling to Minimize Average Completion Time: Offline and Online Approximation Algorithms
- Inventory and Facility Location Models with Market Retsef Levi #1 , Joseph Geunes ##2 , H. Edwin Romeijn # # #3 , and David B. Shmoys +4
- Computational Complexity D.B. Shmoys and '
- Approximation Algorithms for Facility Location David B. Shmoys
- Approximation algorithms for 2stage stochastic optimization problems
- Facility Location with Service Installation Costs (Extended Abstract)
- IMPROVED APPROXIMATION ALGORITHMS FOR THE UNCAPACITATED FACILITY LOCATION PROBLEM
- LPbased Approximation Algorithms for Capacitated Facility Location
- Lagrangian relaxation for the kmedian problem: new insights and continuity properties
- Approximation algorithms for precedenceconstrained scheduling problems on parallel machines that run at different speeds
- Combinatorics in Computer Science Department of Computer Science,
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- Using Linear Programming in the Design and Analysis of Approximation Algorithms
- C H A P T E R CUT PROBLEMS AND THEIR
- Samplingbased Approximation Algorithms for Multistage Stochastic Optimization
- A constantfactor approximation algorithm for the kmedian problem
- Proceedings of Symposia in Applied Mathematics The Design and Analysis of Approximation Algorithms
- A New Approach to Computing Optimal Schedules for the JobShop Scheduling Problem
- A 3approximation algorithm for the klevel uncapacitated facility location problem
- Approximation Algorithms for Stochastic Inventory Control Retsef Levi
- An Approximation Scheme for Stochastic Linear Programming and its Application to Stochastic Integer Programs
- Fault-Tolerant Facility Location CHAITANYA SWAMY
- A constant approximation algorithm for the a priori traveling salesman problem
- Approximation Algorithms for 2-Stage Stochastic Scheduling Problems
- Primal-Dual Schema for Capacitated Covering Tim Carnes and David Shmoys
- Primal-Dual Algorithms for Deterministic Inventory Problems Retsef Levi
- OPERATIONS RESEARCH Vol. 56, No. 5, SeptemberOctober 2008, pp. 11841199
- Algorithms for the Universal and A Priori TSP Frans Schalekamp
- MANAGEMENT SCIENCE Vol. 54, No. 4, April 2008, pp. 763776
- Curriculum Vitae David B. Shmoys
- Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models
