Charles Jolin-Landry

Discrete Optimization Consultant. Here to help find solutions to the hardest computational problems known to computers, NP-Complete problems.