Sanjeeb Dash, Oktay Gunluk, Andrea Lodi and Andrea Tramontani
Article (2012)
Document published while its authors were not affiliated with Polytechnique Montréal
An external link is available for this item
| PolyPublie URL: | https://publications.polymtl.ca/15565/ |
|---|---|
| Journal Title: | INFORMS Journal on Computing (vol. 24, no. 1) |
| Publisher: | Institute for Operations Research and the Management Sciences |
| DOI: | 10.1287/ijoc.1100.0432 |
| Official URL: | https://doi.org/10.1287/ijoc.1100.0432 |
| Date Deposited: | 18 Apr 2023 15:10 |
| Last Modified: | 08 Apr 2025 01:42 |
| Cite in APA 7: | Dash, S., Gunluk, O., Lodi, A., & Tramontani, A. (2012). A time bucket formulation for the traveling salesman problem with time windows. INFORMS Journal on Computing, 24(1), 132-147. https://doi.org/10.1287/ijoc.1100.0432 |
|---|---|
Statistics
Dimensions
Repository Staff Only
|
View Item |
