The following pages link to David B. Shmoys (Q304237):
Displaying 50 items.
- The submodular joint replenishment problem (Q304238) (← links)
- Approximation algorithms for supply chain planning and logistics problems with market choice (Q647392) (← links)
- LP-based approximation algorithms for capacitated facility location (Q662296) (← links)
- An improved approximation algorithm for the partial Latin square extension problem. (Q703265) (← links)
- Primal-dual schema for capacitated covering problems (Q747765) (← links)
- Approximation algorithms for scheduling unrelated parallel machines (Q751989) (← links)
- Recognizing graphs with fixed interval number is NP-complete (Q760213) (← links)
- A PTAS for capacitated sum-of-ratios optimization (Q833588) (← links)
- Analyzing the Held-Karp TSP bound: A monotonicity property with application (Q912624) (← links)
- Algorithms for the universal and a priori TSP (Q924875) (← links)
- Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem (Q1079133) (← links)
- Permutation vs. non-permutation flow shop schedules (Q1180831) (← links)
- An approximation algorithm for the generalized assignment problem (Q1319018) (← links)
- Improved bounds on relaxations of a parallel machine scheduling problem (Q1383802) (← links)
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem (Q1607016) (← links)
- (Q1644925) (redirect page) (← links)
- A bicriteria approximation algorithm for the \(k\)-center and \(k\)-median problems (Q1644926) (← links)
- A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938) (← links)
- Approximations and randomization to boost CSP techniques (Q1876531) (← links)
- On the power of static assignment policies for robust facility location problems (Q2061885) (← links)
- Approximation algorithms for fragmenting a graph against a stochastically-located threat (Q2344215) (← links)
- Minimizing multimodular functions and allocating capacity in bike-sharing systems (Q2401156) (← links)
- (Q2753723) (← links)
- Karp and Smale receive National Medals of Science. (Q2769074) (← links)
- A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract) (Q2819529) (← links)
- Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat (Q2896384) (← links)
- A constant approximation algorithm for the one-warehouse multi-retailer problem (Q2921691) (← links)
- Provably near-optimal sampling-based algorithms for Stochastic inventory control models (Q2931434) (← links)
- In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation (Q2952021) (← links)
- The Design of Approximation Algorithms (Q3010438) (← links)
- Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem (Q3088086) (← links)
- A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems (Q3088089) (← links)
- Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint (Q3098330) (← links)
- A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem (Q3117702) (← links)
- (Q3128880) (← links)
- (Q3138949) (← links)
- (Q3140449) (← links)
- Sampling-Based Approximation Algorithms for Multistage Stochastic Optimization (Q3143299) (← links)
- Improving Christofides' Algorithm for the s-t Path TSP (Q3177743) (← links)
- Approximation Algorithms for Capacitated Stochastic Inventory Control Models (Q3392240) (← links)
- An approximation scheme for stochastic linear programming and its application to stochastic integer programs (Q3455224) (← links)
- Flipping Persuasively in Constant Time (Q3476272) (← links)
- Primal-Dual Schema for Capacitated Covering Problems (Q3503854) (← links)
- A Constant Approximation Algorithm for the a priori Traveling Salesman Problem (Q3503857) (← links)
- Primal-dual algorithms for deterministic inventory problems (Q3581001) (← links)
- Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem (Q3588395) (← links)
- Improved Lower Bounds for the Universal and a priori TSP (Q3588406) (← links)
- Approximation Algorithms for Stochastic Inventory Control Models (Q3596339) (← links)
- Inventory and Facility Location Models with Market Selection (Q3596348) (← links)
- A Best Possible Heuristic for the <i>k</i>-Center Problem (Q3680584) (← links)
