Solving the Supermarket Street Sweep with Integer Linear Programming and O1
I’m a huge fan of alleycats (unsanctioned bike races inspired by bike messengers, where riders choose their routes to complete checkpoints in open traffic). You get handed a manifest and part of the fun is picking a smarter, shorter route than your competition, so even though maybe you’re worse in raw power/speed, you still have a chance at beating your opponent. Recently I and a bunch of other Cakers raced in the Supermarket Street Sweep, a charity race that benefits the SF-Marin Food Bank. Racers receive a manifest that looks something like this: ...