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

Domains

Computer Science [cs] Discrete Mathematics [cs.DM] Computer Science [cs] Operations Research [cs.RO]

Frédéric Semet  : Connect in order to contact the contributor

https://hal.inria.fr/hal-03116606

Submitted on : Wednesday, January 20, 2021-2:25:09 PM

Last modification on : Tuesday, December 6, 2022-12:42:13 PM

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⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

CNRS INRIA CRISTAL INRIA2 TDS-MACS CRISTAL-INOCS UNIV-LILLE
86 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More