The computational results on problems with up to 2750 variables strongly confirm our hypothesis that a combination of problem preprocessing, cutting planes, and clever branch-and-bound techniques ...

This course continues our data structures and algorithms specialization by focussing on the use of linear and integer programming formulations for solving algorithmic problems that seek optimal ...

Carlos F. Daganzo, Karen R. Smilowitz, Bounds and Approximations for the Transportation Problem of Linear Programming and Other Scalable Network Problems, Transportation Science, Vol. 38, No. 3 ...