We propose a mixed integer programming formulation for the delivery man problem and derive additional classes of valid inequalities.?? Computational results are presented for instances of the delivery man problem with time windows.?? In particular??, the quality of the lower bounds obtained from the linear programming relaxation and the e??ectiveness of the additional inequalities in improving these bounds are studied??.
|Place of Publication||Eindhoven|
|Publisher||Technische Universiteit Eindhoven|
|Number of pages||15|
|Publication status||Published - 1995|