Gilles Pesant
, Michel Gendreau, Jean-Yves Potvin and Jean-Marc Rousseau
Article (1999)
An external link is available for this item
| Additional Information: | Nom historique du département: Département de génie électrique et de génie informatique |
|---|---|
| Department: |
Department of Electrical Engineering Department of Computer Engineering and Software Engineering |
| PolyPublie URL: | https://publications.polymtl.ca/28680/ |
| Journal Title: | European Journal of Operational Research (vol. 117, no. 2) |
| Publisher: | Elsevier |
| DOI: | 10.1016/s0377-2217(98)00248-3 |
| Official URL: | https://doi.org/10.1016/s0377-2217%2898%2900248-3 |
| Date Deposited: | 18 Apr 2023 15:22 |
| Last Modified: | 25 Sep 2024 16:09 |
| Cite in APA 7: | Pesant, G., Gendreau, M., Potvin, J.-Y., & Rousseau, J.-M. (1999). On the Flexibility of constraints programming models: from single to multiple time windows for the traveling salesman problem. European Journal of Operational Research, 117(2), 253-263. https://doi.org/10.1016/s0377-2217%2898%2900248-3 |
|---|---|
Statistics
Dimensions
Repository Staff Only
|
View Item |
