Mixed integer programming formulations for the generalized traveling salesman problem with time windows - Archive ouverte HAL Access content directly
Journal Articles 4OR: A Quarterly Journal of Operations Research Year : 2021

Mixed integer programming formulations for the generalized traveling salesman problem with time windows

(1) , (1) , (1) , (1) , (1)
1
Not file

Dates and versions

hal-03116606 , version 1 (20-01-2021)

Identifiers

Cite

Yuan Yuan, Diego Cattaruzza, Maxime Ogier, Cyriaque Rousselot, Frédéric Semet. Mixed integer programming formulations for the generalized traveling salesman problem with time windows. 4OR: A Quarterly Journal of Operations Research, 2021, 19, pp.571-592. ⟨10.1007/s10288-020-00461-y⟩. ⟨hal-03116606⟩
86 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More