Procedures for travelling salesman problems with additional constraints-Reference-Cited by-同舟云学术

Procedures for travelling salesman problems with additional constraints

Published:1979-03 Issue:2 Volume:3 Page:135-141
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Lokin F.C.J.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference4 articles.

1. The clustered travelling salesman problem;Chisman;Comput. Opns. Res.,1975

2. An algorithm for the travelling salesman problem;Little;Opns. Res.,1963

3. The travelling salesman problem and minimum spanning trees;Held;Math. Programming,1971

4. Branch-and-bound algorithms for the travelling salesman problem (in Dutch);Lenstra;MC-Report BN 16/72,1972

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

1. Seçici Kümelendirilmiş Gezgin Satıcı Problemi ve Matematiksel Formülasyonları;Afyon Kocatepe University Journal of Sciences and Engineering;2024-06-08

2. The last-mile delivery vehicle routing problem with handling cost in the front warehouse mode;Computers & Industrial Engineering;2024-04

3. A survey on the Traveling Salesman Problem and its variants in a warehousing context;European Journal of Operational Research;2024-04

4. An adaptive memory matheuristic for the set orienteering problem;European Journal of Operational Research;2023-09

5. A multi-parent genetic algorithm for solving longitude–latitude-based 4D traveling salesman problems under uncertainty;Decision Analytics Journal;2023-09