A polyhedral approach to the delivery man problem

C.A. Eijl, van

Onderzoeksoutput: Boek/rapportRapportAcademic

122 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 e??ectiveness of the additional inequalities in improving these bounds are studied??.
Originele taal-2Engels
Plaats van productieEindhoven
UitgeverijTechnische Universiteit Eindhoven
Aantal pagina's15
StatusGepubliceerd - 1995

Publicatie series

NaamMemorandum COSOR
ISSN van geprinte versie0926-4493


Duik in de onderzoeksthema's van 'A polyhedral approach to the delivery man problem'. Samen vormen ze een unieke vingerafdruk.

Citeer dit