A branch and bound algorithm for symmetric 2-Peripatetic Salesman Problems-Reference-Cited by-同舟云学术

A branch and bound algorithm for symmetric 2-Peripatetic Salesman Problems

Published:1993-10 Issue:2 Volume:70 Page:229-243
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

De Kort Jeroen B.J.M.

Publisher

Elsevier BV

Subject

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

Reference18 articles.

1. Worst-case analysis of a new Heuristic for the Traveling Salesman Problem;Christofides,1976

2. A method for solving Traveling-Salesman Problems;Croes;Operations Research,1958

3. Solving large-scale Traveling Salesman Problems to optimality;Crowder;Management Science,1980

4. Lower bounds for symmetric K-Peripatetic Salesman Problems;De Kort;Optimization,1991

5. Sensitivity Analysis for the 2-Peripatetic Salesman Problem;De Kort,1991

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

1. Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming;Journal of Combinatorial Optimization;2024-07

2. APPROXIMATE ALGORITHMS FOR TWO-COMMODITY AND TWO-CYCLE COVERING PROBLEMS ON MAXIMUM WITH TWO WEIGHT FUNCTIONS;SIB ELECTRON MATH RE;2023

3. Safe and secure vehicle routing: a survey on minimization of risk exposure;International Transactions in Operational Research;2022-03

4. The multiple shortest path problem with path deconfliction;European Journal of Operational Research;2021-08

5. A Polynomial Algorithm with Asymptotic Ratio $$\boldsymbol {2/3}$$ for the Asymmetric Maximization Version of the $$\boldsymbol m $$-PSP;Journal of Applied and Industrial Mathematics;2020-08