A polyhedral approach to the delivery man problem

C.A. Eijl, van

Research output: Book/ReportReportAcademic

146 Downloads (Pure)


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 effectiveness of the additional inequalities in improving these bounds are studied.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Number of pages15
Publication statusPublished - 1995

Publication series

NameMemorandum COSOR
ISSN (Print)0926-4493


Dive into the research topics of 'A polyhedral approach to the delivery man problem'. Together they form a unique fingerprint.

Cite this