1 |
Riera-Ledesma, J., Salazar-Gonalez, J. J. (2005a), A heuristic approach for the traveling purchaser problem, European Journal of Operational Research, 162, 142-152.
DOI
ScienceOn
|
2 |
Bontoux, B. and Feillet, D. (2008), Ant colony optimization for the traveling purchaser problem, Computers and Operations Research, 35, 628-637.
DOI
ScienceOn
|
3 |
Mansini, R. and Tocchella, B. (2009), The traveling purchaser problem with budget constraint, Computers and Operations Research, 36, 2263-2274.
DOI
ScienceOn
|
4 |
Riera-Ledesma, J. and Salazar-Gonalez, J. J. (2006), Solving the asymmetric traveling purchaser problem, Annals of Operations Research, 144, 83-97.
DOI
ScienceOn
|
5 |
Singh, K. N. and van Oudheusden, D. L. (1997), A branch and bound algorithm for the traveling purchaser problem, European Journal of Operational Research, 97, 571-579.
DOI
ScienceOn
|
6 |
Teeninga, A. and Volgenant, A. (2004), Improved heuristics for the traveling purchaser problem, Computers and Operations Research 31, 139-150.
DOI
ScienceOn
|
7 |
Pearn, W. L. and Chien, R. C. (1998), Improved solutions for the traveling purchaser problem, Computers and Operations Research, 25, 879-885.
DOI
ScienceOn
|
8 |
, S. (1996), Dynamic tabu search strategies for the traveling purchaser problem, Annals of Operations Research, 63, 253-275.
DOI
ScienceOn
|
9 |
Miller C. E., Tucker, A. W., and Zemlin R. A. (1960), Integer programming formulation of traveling salesman problems, Journal of Association for Computing Machinery, 7, 326-329.
DOI
|
10 |
Ong, H. L. (1982), Approximate algorithm for the traveling purchaser problem, Operations Research Letters, 1, 201-205.
DOI
ScienceOn
|
11 |
Ramesh, T. (1981), traveling purchaser problem, Journal of the Operational Research Society of India, 18, 78-91.
|
12 |
Ravi, R. and Salman, S. (1999), Approximation algorithms for the traveling purchaser problem and its variants in network design, Lecture notes in computer science, 1643, 29-40.
DOI
|
13 |
Riera-Ledesma, J. and Salazar-Gonalez, J. J. (2005b), The biobjective traveling purchaser problem, European Journal of Operational Research, 160, 599-613.
DOI
ScienceOn
|
14 |
Angelelli, E., Mansini, R., and Vindigni, M. (2009), Exploring greedy criteria for the dynamic traveling purchaser problem, Central European Journal of Operations Research, 17(2), 141-158.
DOI
ScienceOn
|
15 |
Boctor, F. F., Laporte, G., and Renaud, J. (2003), Heuristics for the traveling purchaser problem, Computers and Operations Research, 30, 491-504.
DOI
ScienceOn
|
16 |
Goldbarg, M. C., Bagi, L. B., and Goldbarg, E. F. G. (2008), Transgenetic algorithm for the traveling purchaser problem, European Journal of Operational Research, 199, 36-45.
|
17 |
Burstall, R. M. (1966), A heuristic method for a job sequencing problem, Operational Research Quarterly, 17, 291-304.
DOI
|
18 |
Buzacott, J. A. and Dutta, S. K. (1971), Sequencing many jobs on a multipurpose facility, Naval Research Logistics Quarterly, 18, 75-82.
DOI
|
19 |
Current, J., Revelle, C., and Cohon, J. (1984), The shortest covering path problem : an application of locational constraints to network design, Journal of Regional Science, 24, 161-183.
DOI
|
20 |
Golden, B. L., Levy, L., and Dahl, R. (1981), Two generations of the traveling salesman problem, Omega, 9, 439-445.
DOI
ScienceOn
|
21 |
Jain, R., Rivera, M. C., Moore, J. E., and Lake, J. A. (2003), Horizontal gene transfer accelerates genome innovation and evolution, Molecular Biology and Evolution, 20, 1598-1602.
DOI
ScienceOn
|
22 |
Laporte, G., Riera-Ledesma, J., and Salazar-Gonález, J. J. (2003), A branch and cut algorithm for the undirected traveling purchaser problem, Operations Research, 51(6), 142-152.
|
23 |
Lomnicki, Z. A. (1996), Job scheduling, Operational Research Quaterly, 17, 314-316.
|
24 |
Margulis, L. (1992), Symbiosis in cell evolution, Microbial communities in the archean and proterozoic eon., W. H. Freeman.
|