Heuristics for the traveling purchaser problem-Reference-Cited by-同舟云学术

Heuristics for the traveling purchaser problem

Published:2003-04 Issue:4 Volume:30 Page:491-504
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Boctor Fayez F.,Laporte Gilbert,Renaud Jacques

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modelling and Simulation,General Computer Science

Reference13 articles.

1. Traveling purchaser problem;Ramesh;Opsearch,1981

2. Laporte G, Riera-Ledesma J, Salazar-González J-J. A branch-and-cut algorithm for the undirected traveling purchaser problem. 2000, Unpublished paper.

3. A branch and bound algorithm for the traveling purchaser problem;Singh;European Journal of Operational Research,1997

4. Sequencing many jobs on a multipurpose facility;Buzacott;Naval Research Logistics Quarterly,1971

5. An efficient composite heuristic for the symmetric generalized traveling salesman problem;Renaud;European Journal of Operational Research,1998

Cited by 46 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The traveling purchaser problem for perishable foods;Computers & Industrial Engineering;2024-09

2. Solution of the family traveling salesman problem using a hyper-heuristic approach;Engineering Applications of Artificial Intelligence;2024-07

3. A Pattern Recognition Lexi-Search Approach to the Variant Traveling Purchaser Problem;IEEE Access;2024

4. Simulated Annealing for the Traveling Purchaser Problem in Cold Chain Logistics;Lecture Notes in Mechanical Engineering;2023-10-02

5. Multi-vehicle clustered traveling purchaser problem using a variable-length genetic algorithm;Engineering Applications of Artificial Intelligence;2023-08