Colebrook M.

M. Colebrook

Information about the author M. Colebrook will soon be added to the site.
Found 5 papers in total
A polynomial algorithm for the production/ordering planning problem with limited storage
A polynomial algorithm for the production/ordering planning problem with limited storage
2007
This paper concerns the dynamic lot size problem where the storage capacity is limited...
A new bound and an O(mn) algorithm for the undesirable 1-median problem (maxian) on networks
A new bound and an O(mn) algorithm for the undesirable 1-median problem (maxian) on networks
2005
The problem of locating an undesirable facility on a network with n nodes and m edges...
A new algorithm for the undesirable 1-center problem on networks
A new algorithm for the undesirable 1-center problem on networks
2002
Recent papers have developed efficient algorithms for the location of an undesirable...
A new characterization for the dynamic lot size problem with bounded inventory
A new characterization for the dynamic lot size problem with bounded inventory
2003
In this paper, we address the dynamic lot size problem with storage capacity. As in...
Locating a facility on a network with multiple median-type objectives
Locating a facility on a network with multiple median-type objectives
1999
We consider the problem of locating a single facility on a network in the presence of...
Papers per page: