154 results on '"Sitters, René"'
Search Results
2. The triangle scheduling problem
3. Fixed-Order Scheduling on Parallel Machines
4. Scheduling over Scenarios on Two Machines
5. The Chinese deliveryman problem
6. Polynomial time approximation schemes for the traveling repairman and other minimum latency problems
7. The Itinerant List Update Problem
8. Split Scheduling with Uniform Setup Times
9. The generalized work function algorithm is competitive for the generalized 2-server problem
10. The traveling salesman problem on cubic and subcubic graphs
11. The Sorting Buffer Problem is NP-hard
12. The Traveling Salesman Problem Under Squared Euclidean Distances
13. On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
14. A priori TSP in the scenario model
15. A priori TSP in the Scenario Model
16. The A Priori Traveling Repairman Problem
17. Fixed-Order Scheduling on Parallel Machines
18. On the Complexity of Master Problems
19. Routing Under Uncertainty: The a priori Traveling Repairman Problem
20. Scheduling Reclaimer Operations in the Stockyard to Minimize Makespan
21. The triangle scheduling problem
22. Generalized Two-Server Problem
23. The Itinerant List Update Problem
24. Approximability of average completion time scheduling on unrelated machines
25. TSP on Cubic and Subcubic Graphs
26. Efficient Algorithms for Average Completion Time Scheduling
27. Connected Feedback Vertex Set in Planar Graphs
28. Minimizing Average Flow Time on Unrelated Machines
29. Generalized Two-Server Problem : 2006; Sitters, Stougie 2006; Sitters, Stougie
30. Approximability of Average Completion Time Scheduling on Unrelated Machines
31. A priori TSP in the Scenario Model
32. On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems
33. A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
34. On Approximating the TSP with Intersecting Neighborhoods
35. How to Sell a Graph: Guidelines for Graph Retailers
36. On the Value of Preemption in Scheduling
37. Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays
38. Approximation Algorithms for Euclidean Group TSP
39. A Competitive Algorithm for the General 2-Server Problem
40. The Minimum Latency Problem Is NP-Hard for Weighted Trees
41. On-Line Dial-a-Ride Problems under a Restricted Information Model
42. Two NP-hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines
43. On the complexity of the highway problem
44. Split scheduling with uniform setup times
45. A note on sorting buffers offline
46. The traveling salesman problem on cubic and subcubic graphs
47. On the Complexity of Master Problems
48. Routing Under Uncertainty: The a priori Traveling Repairman Problem
49. On the minimum corridor connection problem and other generalized geometric problems
50. Generalized Two-Server Problem
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.