Routing with time windows by column generation, Networks, vol.14, issue.4, pp.545-565, 1984. ,
DOI : 10.1002/net.3230140406
Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows, Management Science, vol.34, issue.8, pp.1005-1022, 1988. ,
DOI : 10.1287/mnsc.34.8.1005
The Theory of Search, Operations Research, vol.5, issue.5, pp.613-626, 1957. ,
DOI : 10.1287/opre.5.5.613
Search for a Moving Target: The FAB Algorithm, Operations Research, vol.31, issue.4, pp.739-751, 1983. ,
DOI : 10.1287/opre.31.4.739