Bringing together three of Bob's interests, linear programming, computation, and astronomy, we describe techniques used to find a traveling salesman problem tour through the 3D positions of 2,079,471 stars. Together with Keld Helsguan, we proved the tour is at most 1.0000074 times longer than an optimal route. Going practical, we also discuss methods used to compute constrained tours for delivery-van drivers. This van-routing work, together with Stephan Held and Keld Helsgaun, won the $100,000 top prize in the Amazon Last Mile Routing Challenge held in 2021.