Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A branch-and-cut algorithm for the generalized traveling salesman problem ..."

Yuan Yuan et al. (2020)

> Home

Details and statistics

DOI: 10.1016/J.EJOR.2020.04.024

access: closed

type: Journal Article

metadata version: 2022-01-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/eor/YuanCOS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/YuanCOS20
Yuan Yuan, Diego Cattaruzza, Maxime Ogier, Frédéric Semet:
A branch-and-cut algorithm for the generalized traveling salesman problem with time windows. Eur. J. Oper. Res. 286(3): 849-866 (2020)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.