The optimization problem is formulated as a mixed-integer linear program and a test network is solved by branch-and-bound techniques using IBM's MPSX package. Transportation Science published by ...

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 ...

Linear Relaxation: The process of removing the integer constraints from an integer programming problem to solve an easier continuous problem that provides bounds for the original.