Algorithms to Live By: The Computer Science of Human Decisions

by Brian Christian

Temporarily removing constraints, as in the minimum spanning tree and the “what if you won the lottery?” examples, is the most straightforward form of algorithmic relaxation.