A branch and bound algorithm for the traveling purchaser problem

European Journal of Operational Research

Volumn 97, Issue 3, 1997, Pages 571-579

  Singh, Kashi N ^a,c   Van Oudheusden, Dirk L ^b  

^a NATIONAL INSTITUTE OF TECHNOLOGY PATNA   (India)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^c NATIONAL INSTITUTE OF INDUSTRIAL ENGINEERING NITIE   (India)

Author keywords

Algorithm; Heuristic; Simple plant location problem; Traveling purchaser problem; Traveling salesman problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DISTRIBUTION OF GOODS; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING; SITE SELECTION; STRATEGIC PLANNING;

BRANCH AND BOUND ALGORITHM;

OPERATIONS RESEARCH;

EID: 0031099986     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(96)00313-X     Document Type: Article

References (15)

1. Bilde, O., and Krarup, J. (1977), "Sharp lower bounds and efficient algorithms for the simple plant location problems", Annals of Discrete Mathematics 1, 79-97.
2. Burstall, R.M. (1966), "A heuristic method for a job sequencing problem", Operational Research Quarterly 17, 291-304.
3. Buzacott, J.A., and Dutta, S.K. (1971), "Sequencing many jobs on a multipurpose facility", Naval Research Logistics Quarterly 18, 75-82.
4. 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.
5. Efroymson, M.A., and Ray, T.L. (1966), "A branch and bound algorithm for plant location problem', Operations Research 14, 361-368.
6. Erlenkotter, D. (1978), "A dual-based procedure for uncapacitated facility location", Operations Research 26, 992-1109.
7. Golden, B., Levy, L., and Dahl, R. (1981), "Two generalizations of the traveling salesman problem", OMEGA 9, 439-455.
8. Hansen, P., and van Oudheusden, D.L. (1972), "One-machine Scheduling with Sequence-dependent change-over costs", Working paper, Free University, Brussels.
9. Karg, R.L., and Thompson, G.L. (1964), "A heuristic approach to solving traveling salesman problem", Management Science 10, 225-248.
10. Little, J.D.C., Murty, K.G., Sweeney, D.W., and Karel, C. (1963), "An algorithm for the traveling salesman problem", Operations Research 11, 972-989.
11. Lomnicki, Z.A. (1966), "Job Scheduling", Operational Research Quarterly 17, 314-316.
12. Ong, H.L. (1982), "Approximate algorithms for traveling purchaser problem", Operations Research Letters 1, 201-205.
13. Ramesh, T. (1981), "Traveling purchaser problem", Opsearch 18, 78-91.
14. Singh, K.N. (1985), "The SPLP-model in scheduling and routing", Doctoral dissertation, IE85-1, Asian Institute of Technology, Bangkok, Thailand, 55-68.
15. Van Roy, T.J., and Erlenkotter, D. (1982), "A dual-based procedure for dynamic facility location problem", Management Science 25, 1091-1105.