In the classical secretary problem an employer would like to choose the best candidate among n competing candidates that arrive in a random order. In each iteration, one candidate's rank vis-a-vis ...

We designed a simple computational exercise to compare weak and strong integer programming formulations of the traveling salesman problem. Using commercial IP software, and a short (60 line long) ...

Last year, I started writing about my experiences taking courses on machine learning and artificial intelligence. One of the big, unexpected problems I ran into was calculus and linear algebra. I've ...