Yesterday, April 15th, @Ollie posted this riddler to fivethirtyeight:
You are the CEO of a space transport company in the year 2080, and your chief scientist comes in to tell you that one of your space probes has detected an alien artifact at the Jupiter Solar Lagrangian (L2) point.
You want to be the first to get to it! But you know that the story will leak soon and you only have a short time to make critical decisions. With standard technology available to anyone with a few billion dollars, a manned rocket can be quickly assembled and arrive at the artifact in 1,600 days. But with some nonstandard items you can reduce that time and beat the competition. Your accountants tell you that they can get you an immediate line of credit of $1 billion.
You can buy:

Big Russian engines. There are only three in the world and the Russians want $400 million for each of them. Buying one will reduce the trip time by 200 days. Buying two will allow you to split your payload and will save another 100 days.

NASA ion engines. There are only eight of these $140 million largescale engines in the world. Each will consume 5,000 kilograms of xenon during the trip. There are 30,000 kg of xenon available worldwide at a price of $2,000/kg, so 5,000 kg costs $10 million. Bottom line: For each $150 million fully fueled xenon engine you buy, you can take 50 days off of the trip.

Light payloads. For $50 million each, you can send one of four return flight fuel tanks out ahead of the mission, using existing technology. Each time you do this, you lighten the main mission and reduce the arrival time by 25 days.
What’s your best strategy to get there first?
Given that you don’t have to care about what the competition can or cannot buy it really just turns into an optimization problem. Since there are less than 10^9 or so permutations I went ahead and brute forced the problem. The solution:
Buying 1 Big Russian engine, 3 NASA ion engines (with 15 kg of fuel) and 3 Light payloads will reduce the time of your trip by the most, 425 days, for a cost of 1 billion dollars.
Here is the code if you want to check it out