"Upper Bound Computation for the Multiple Close-Enough Traveling Salesman ..."

Francesco Carrabs et al. (2025)

> Home

Details and statistics

DOI: 10.5220/0013377900003893

access: closed

type: Conference or Workshop Paper

metadata version: 2025-05-31

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icores/CarrabsCDM25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icores/CarrabsCDM25
Francesco Carrabs, Raffaele Cerulli, Ciriaco D'Ambrosio, Gabriele Murano:
Upper Bound Computation for the Multiple Close-Enough Traveling Salesman Problem. ICORES 2025: 186-195

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.