Borzou Rostami, Andre Chassein, Michael Hopf, Davide Frey, Christoph Buchheim, Federico Malucelli and Marc Goerigk
Article (2018)
An external link is available for this item
| Department: | Department of Mathematics and Industrial Engineering |
|---|---|
| Research Center: |
CIRRELT - Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation GERAD - Research Group in Decision Analysis |
| PolyPublie URL: | https://publications.polymtl.ca/39927/ |
| Journal Title: | European Journal of Operational Research (vol. 268, no. 2) |
| Publisher: | Elsevier |
| DOI: | 10.1016/j.ejor.2018.01.054 |
| Official URL: | https://doi.org/10.1016/j.ejor.2018.01.054 |
| Date Deposited: | 18 Apr 2023 15:03 |
| Last Modified: | 25 Sep 2024 16:25 |
| Cite in APA 7: | Rostami, B., Chassein, A., Hopf, M., Frey, D., Buchheim, C., Malucelli, F., & Goerigk, M. (2018). The quadratic shortest path problem: complexity, approximability, and solution methods. European Journal of Operational Research, 268(2), 473-485. https://doi.org/10.1016/j.ejor.2018.01.054 |
|---|---|
Statistics
Dimensions
Repository Staff Only
|
View Item |
