Nathalie Bostel, Philippe Castagliola, Pierre Dejax et André Langevin
Article de revue (2014)
Un lien externe est disponible pour ce document
Abstract
This article develops simple and easy-to-use approximation formulae for the length of a Chinese Postman Problem (CPP) optimal tour on directed and undirected strongly connected planar graphs as a function of the number of nodes and the number of arcs for graphs whose nodes are randomly distributed on a unit square area. These approximations, obtained from a multi-linear regression analysis, allow to easily forecast the length of a CPP optimal tour for various practical combinations of number of arcs and nodes ranging, from 10 to 300 nodes and 15 to 900 arcs.
| Matériel d'accompagnement: | |
|---|---|
| Département: | Département de mathématiques et de génie industriel |
| Organismes subventionnaires: | NSERC |
| URL de PolyPublie: | https://publications.polymtl.ca/12668/ |
| Titre de la revue: | 4or-a Quarterly Journal of Operations Research (vol. 12, no 4) |
| Maison d'édition: | Springer |
| DOI: | 10.1007/s10288-014-0260-9 |
| URL officielle: | https://doi.org/10.1007/s10288-014-0260-9 |
| Date du dépôt: | 18 avr. 2023 15:07 |
| Dernière modification: | 23 mars 2026 15:37 |
| Citer en APA 7: | Bostel, N., Castagliola, P., Dejax, P., & Langevin, A. (2014). Approximating the length of Chinese postman tours. 4or-a Quarterly Journal of Operations Research, 12(4), 359-372. https://doi.org/10.1007/s10288-014-0260-9 |
|---|---|
Statistiques
Dimensions
Actions réservées au personnel
|
Afficher document |
