Seminar
Wednesday December 19th 2001, 11am
Room 205, The Management School, Imperial College
53 Princes Gate, Exhibition Road, London
Exact solution of the undirected rural postman problem
by
Gilbert Laporte
Canada Research Chair in Distribution Management
The well-known Undirected Rural Postman Problem is considered.
A binary linear programming formulation based on a new dominance
relation is developed. Polyhedral properties of the model are
presented and a branch-and-cut algorithm is described. The
proposed algorithm can solve much larger instances than previously
reported.
--------------------------------------------------------------------
Feel free to contact J E Beasley ([log in to unmask])
if you have any questions with regard to this seminar
|