Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph
RAIRO-Oper. Res., 15 3 (1981) 233-239
Published online: 2017-02-06
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 new integer programming formulation of the graphical traveling salesman problem
Robert Carr, R. Ravi and Neil SimonettiMathematical Programming 197 (2) 877 (2023)
https://doi.org/10.1007/s10107-022-01849-w
A note on computational aspects of the Steiner traveling salesman problem
Eduardo Álvarez‐Miranda and Markus SinnlInternational Transactions in Operational Research 26 (4) 1396 (2019)
https://doi.org/10.1111/itor.12592
The Steiner Traveling Salesman Problem and its extensions
Jessica Rodríguez-Pereira, Elena Fernández, Gilbert Laporte, Enrique Benavent and Antonio Martínez-SykoraEuropean Journal of Operational Research 278 (2) 615 (2019)
https://doi.org/10.1016/j.ejor.2019.04.047
792 (2014)
https://doi.org/10.1109/ITSC.2014.6957786
Compact formulations of the Steiner Traveling Salesman Problem and related problems
Adam N. Letchford, Saeideh D. Nasiri and Dirk Oliver TheisEuropean Journal of Operational Research 228 (1) 83 (2013)
https://doi.org/10.1016/j.ejor.2013.01.044
A new class of cutting planes for the symmetric travelling salesman problem
Bernhard FleischmannMathematical Programming 40-40 (1-3) 225 (1988)
https://doi.org/10.1007/BF01580734
A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem
G. Laporte, Y. Nobert and S. TailleferMathematical Modelling 9 (12) 857 (1987)
https://doi.org/10.1016/0270-0255(87)90004-2
Surveys in Combinatorial Optimization
Gilbert Laporte and Yves NobertNorth-Holland Mathematics Studies, Surveys in Combinatorial Optimization 132 147 (1987)
https://doi.org/10.1016/S0304-0208(08)73235-3
An exact algorithm for solving a capacitated location-routing problem
G. Laporte, Y. Nobert and D. ArpinAnnals of Operations Research 6 (9) 291 (1986)
https://doi.org/10.1007/BF02023807
Combinatorial analysis (nonnegative matrices, algorithmic problems)
V. A. Nosov, V. N. Sachkov and V. E. TarakanovJournal of Soviet Mathematics 29 (1) 1051 (1985)
https://doi.org/10.1007/BF02104831
Two exact algorithms for the distance‐constrained vehicle routing problem
Gilbert Laporte, Martin Desrochers and Yves NobertNetworks 14 (1) 161 (1984)
https://doi.org/10.1002/net.3230140113
Optimal tour planning with specified nodes
Gilbert Laporte, Hélène Mercure and Yves NorbertRAIRO - Operations Research 18 (3) 203 (1984)
https://doi.org/10.1051/ro/1984180302031
A branch and bound algorithm for the capacitated vehicle routing problem
G. Laporte and Y. NobertOperations-Research-Spektrum 5 (2) 77 (1983)
https://doi.org/10.1007/BF01720015
Distance conserving reductions for nonoriented networks
B. FleischmannOperations-Research-Spektrum 5 (4) 195 (1983)
https://doi.org/10.1007/BF01719842
Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
Gilbert Laporte and Yves NobertINFOR: Information Systems and Operational Research 21 (1) 61 (1983)
https://doi.org/10.1080/03155986.1983.11731885