Paper (2005)
Document published while its authors were not affiliated with Polytechnique Montréal
This item is not archived in PolyPublie
| PolyPublie URL: | https://publications.polymtl.ca/33691/ |
|---|---|
| Conference Title: | 43rd Annual Allerton Conference on Communications, Control and Computing |
| Conference Location: | Monticello, Illinois, USA |
| Conference Date(s): | 2005-09-28 - 2005-09-30 |
| Date Deposited: | 18 Apr 2023 15:18 |
| Last Modified: | 05 Apr 2024 11:25 |
| Cite in APA 7: | Le Ny, J., & Feron, E. (2005, September). An approximation algorithm for the curvature-constrained traveling salesman problem [Paper]. 43rd Annual Allerton Conference on Communications, Control and Computing, Monticello, Illinois, USA. |
|---|---|
Statistics
Stats are not available on this system.
Repository Staff Only
|
View Item |
