Article references

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:

Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph

P. Miliotis, G. Laporte, Y. Nobert

RAIRO-Oper. Res., 15 3 (1981) 233-239

Published online: 2017-02-06

DOI: https://doi.org/10.1051/ro/1981150302331

This article has been cited by the following article(s):

A branch and bound algorithm for the capacitated vehicle routing problem

G. Laporte and Y. Nobert
Operations-Research-Spektrum 5 (2) 77 (1983)
DOI: 10.1007/BF01720015
See this article

A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem

G. Laporte, Y. Nobert and S. Taillefer
Mathematical Modelling 9 (12) 857 (1987)
DOI: 10.1016/0270-0255(87)90004-2
See this article

Compact formulations of the Steiner Traveling Salesman Problem and related problems

Adam N. Letchford, Saeideh D. Nasiri and Dirk Oliver Theis
European Journal of Operational Research 228 (1) 83 (2013)
DOI: 10.1016/j.ejor.2013.01.044
See this article

Surveys in Combinatorial Optimization

Gilbert Laporte and Yves Nobert
North-Holland Mathematics Studies, Surveys in Combinatorial Optimization 132 147 (1987)
DOI: 10.1016/S0304-0208(08)73235-3
See this article