A Branch-and-Cut and MIP-based heuristics for the Prize-Collecting Travelling Salesman Problem
RAIRO-Oper. Res., 55 (2021) S719-S726
Published online: 2021-03-02
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
A survey on the Traveling Salesman Problem and its variants in a warehousing context
Stefan Bock, Stefan Bomsdorf, Nils Boysen and Michael SchneiderEuropean Journal of Operational Research 322 (1) 1 (2025)
https://doi.org/10.1016/j.ejor.2024.04.014
(2025)
https://doi.org/10.2139/ssrn.5159964
A Novel Algorithm for Solving the Prize Collecting Traveling Salesman Problem Based on DNA Computing
Zhao-Cai Wang, Kun Liang, Xiao-Guang Bao and Tun-Hua WuIEEE Transactions on NanoBioscience 23 (2) 220 (2024)
https://doi.org/10.1109/TNB.2023.3307458
Comparison Between an Exact and a Heuristic-Based Traveling Salesman Problem with Time Window Constraints
Mihaela-Alexandra Barb-CiorbeaBulletin of the Polytechnic Institute of Iași. Electrical Engineering, Power Engineering, Electronics Section 69 (3) 99 (2023)
https://doi.org/10.2478/bipie-2023-0017
Hybrid genetic algorithm for undirected traveling salesman problems with profits
Pengfei He, Jin‐Kao Hao and Qinghua WuNetworks 82 (3) 189 (2023)
https://doi.org/10.1002/net.22167
Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem
Guido Pantuza and Mauricio C. de SouzaInternational Transactions in Operational Research 29 (2) 729 (2022)
https://doi.org/10.1111/itor.13039
Optimization and Applications
Michael Khachay, Katherine Neznakhina and Ksenia RizhenkoLecture Notes in Computer Science, Optimization and Applications 13781 81 (2022)
https://doi.org/10.1007/978-3-031-22543-7_6