Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances.

Developing fixed-point algorithm descriptions used to require tradeoffs between design functionality, modeling of numerical precision, and validation (simulation) speed. Now, a new class of C++ ...