143 results on '"Shmoys, David"'
Search Results
2. Bounding the Price-of-Fair-Sharing Using Knapsack-Cover Constraints to Guide Near-Optimal Cost-Recovery Algorithms
3. Network Flow Problems with Electric Vehicles
4. Hitting Sets when the Shallow Cell Complexity is Small
5. Scheduling Appointments Online: The Power of Deferred Decision-Making
6. On the Power of Static Assignment Policies for Robust Facility Location Problems
7. Data-Driven Rebalancing Methods for Bike-Share Systems
8. Bike Sharing
9. A Bicriteria Approximation Algorithm for the k-Center and k-Median Problems
10. Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems
11. Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat
12. Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem
13. A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems
14. Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem
15. Improved Lower Bounds for the Universal and a priori TSP
16. A Constant Approximation Algorithm for the a priori Traveling Salesman Problem
17. Primal-Dual Schema for Capacitated Covering Problems
18. Approximation Algorithms for 2-Stage Stochastic Scheduling Problems
19. Approximation Algorithms for 2-Stage Stochastic Optimization Problems
20. Inventory and Facility Location Models with Market Selection
21. Approximation Algorithms for Stochastic Inventory Control Models
22. LP-based Approximation Algorithms for Capacitated Facility Location
23. Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties
24. Approximation Algorithms for Facility Location Problems
25. Using linear programming in the design and analysis of approximation algorithms: Two illustrative problems
26. Improved scheduling algorithms for minsum criteria : Extended abstract
27. A new approach to computing optimal schedules for the job-shop scheduling problem
28. The Design of Approximation Algorithms
29. Approximation Algorithms for Constrained Scheduling
30. A polynomial approximation scheme for machine scheduling on uniform processors: Using the dual approximation approach
31. Approximation Algorithms for Scheduling Unrelated Parallel Machines
32. Exactness Results
33. Optimality of QPLEX Iterates
34. Optimality of Information Iterates
35. Introduction to Foundations
36. Introduction to Graphical QPLEX Calculus
37. Graphical QPLEX Calculus with Distributional Programs
38. Information Structure
39. Efficient Calculation for Distributional Programs
40. Subsystem QPLEX Calculus
41. Advanced Transition Dynamics
42. Models with Advanced Transition Dynamics
43. Conditional Independence
44. Conditional and Joint Probabilities
45. First Look at QPLEX
46. Models with Simple Transition Dynamics
47. Simple Transition Dynamics
48. Introduction to QPLEX Modeling and Calculus
49. Preliminaries
50. Applications of Point Process Convergence
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.