"Computing compatible tours for the symmetric traveling salesman problem."

Matteo Fortini et al. (2011)

> Home

Details and statistics

DOI: 10.1007/S12532-010-0021-5

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mpc/FortiniLLW11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mpc/FortiniLLW11
Matteo Fortini, Adam N. Letchford, Andrea Lodi, Klaus Michael Wenger:
Computing compatible tours for the symmetric traveling salesman problem. Math. Program. Comput. 3(1): 59-78 (2011)

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.