<  Back to the Polytechnique Montréal portal

An exact e-constraint method for bi-objective combinatorial optimization problems - application to the traveling salesman problem with profits

Jean-François Bérubé, Michel Gendreau and Jean-Yves Potvin

Working Paper (2007)

Document published while its authors were not affiliated with Polytechnique Montréal

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
PolyPublie URL: https://publications.polymtl.ca/55019/
Report number: CIRRELT-2007-05
Official URL: https://www.cirrelt.ca/documentstravail/cirrelt-20...
Date Deposited: 11 Sep 2023 10:45
Last Modified: 11 Sep 2023 10:45
Cite in APA 7: Bérubé, J.-F., Gendreau, M., & Potvin, J.-Y. (2007). An exact e-constraint method for bi-objective combinatorial optimization problems - application to the traveling salesman problem with profits. (Working Paper n° CIRRELT-2007-05). https://www.cirrelt.ca/documentstravail/cirrelt-2007-05.pdf

Statistics

Stats are not available on this system.

Repository Staff Only

View Item View Item