122 results on '"Shmoys, David B."'
Search Results
2. Hitting Sets when the Shallow Cell Complexity is Small
3. Fairmandering: A column generation heuristic for fairness-optimized political districting
4. Data-Driven Rebalancing Methods for Bike-Share Systems
5. Bike Sharing
6. A min-max theorem for the minimum fleet-size problem
7. GILP: An Interactive Tool for Visualizing the Simplex Algorithm
8. Booster vaccination protection against SARS-CoV-2 infections in young adults during an Omicron BA.1-predominant period: A retrospective cohort study
9. Erratum to “Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems”
10. Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems
11. Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems
12. From Switch Scheduling to Datacenter Scheduling
13. Booster vaccination protection against SARS-CoV-2 infections in young adults during an Omicron BA.1-predominant period: a retrospective cohort study
14. Modeling for COVID-19 college reopening decisions: Cornell, a case study
15. Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem
16. Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat
17. Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem
18. A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems
19. Improved Lower Bounds for the Universal and a priori TSP
20. Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem
21. Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
22. Approximation Algorithms for 2-Stage Stochastic Optimization Problems
23. Inventory and Facility Location Models with Market Selection
24. Approximation Algorithms for Stochastic Inventory Control Models
25. LP-based Approximation Algorithms for Capacitated Facility Location
26. Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties
27. Approximation Algorithms for Facility Location Problems
28. A new approach to computing optimal schedules for the job-shop scheduling problem
29. Improved scheduling algorithms for minsum criteria
30. Analytics and Bikes: Riding Tandem with Motivate to Improve Mobility
31. Chapter 9 Sequencing and scheduling: Algorithms and complexity
32. Approximation Algorithms for Constrained Scheduling
33. Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems
34. Bike Angels
35. Aggregating courier deliveries
36. A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems
37. Improving Christofides' Algorithm for the s-t Path TSP
38. The submodular joint replenishment problem
39. A polynomial approximation scheme for machine scheduling on uniform processors: Using the dual approximation approach
40. Approximation Algorithms for Scheduling Unrelated Parallel Machines
41. Techniques in Proving the Hardness of Approximation
42. Further Uses of Randomized Rounding of Semidefinite Programs
43. An Introduction to Approximation Algorithms
44. Preface
45. Further Uses of Cuts and Metrics
46. Further Uses of Deterministic Rounding of Linear Programs
47. Greedy Algorithms and Local Search
48. Linear Programming
49. Further Uses of the Primal-Dual Method
50. Rounding Data and Dynamic Programming
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.