All Colors Shortest Path problem on trees-Reference-Cited by-同舟云学术

All Colors Shortest Path problem on trees

Published:2018-03-30 Issue:4 Volume:24 Page:617-644
ISSN:1381-1231
Container-title:Journal of Heuristics
language:en
Short-container-title:J Heuristics

Author:

Akçay Mehmet Berkehan,Akcan Hüseyin^ORCID,Evrendilek Cem

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Management Science and Operations Research,Control and Optimization,Computer Networks and Communications,Information Systems,Software

Link

http://link.springer.com/article/10.1007/s10732-018-9370-4/fulltext.html

Reference29 articles.

1. Akçay, M.B.: All colors shortest path problem on trees. Master’s thesis, Izmir University of Economics, Izmir (2015)

2. Bilge, Y.C., Çağatay, D., Genç, B., Sarı, M., Akcan, H., Evrendilek, C.: All colors shortest path problem (2015). arXiv:1507.06865

3. Dror, M., Haouari, M., Chaouachi, J.: Generalized spanning trees. Eur. J. Oper. Res. 120(3), 583–592 (2000)

4. Feremans, C., Labbé, M., Laporte, G.: A comparative analysis of several formulations for the generalized minimum spanning tree problem. Networks 39(1), 29–34 (2002)

5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

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

1. Shortest paths with exclusive-disjunction arc pairs conflicts;Computers & Operations Research;2023-04

2. Spanning simple path inside a simple polygon;The Journal of Supercomputing;2022-08-22

3. A reduction heuristic for the all-colors shortest path problem;RAIRO - Operations Research;2021

4. A two-level metaheuristic for the all colors shortest path problem;Computational Optimization and Applications;2018-06-08