"An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the ..."

Francesco Carrabs et al. (2020)

> Home

Details and statistics

DOI: 10.1287/IJOC.2020.0962

access: closed

type: Journal Article

metadata version: 2020-12-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/informs/CarrabsCCG20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/informs/CarrabsCCG20
Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli, Bruce L. Golden:
An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem. INFORMS J. Comput. 32(4): 1030-1048 (2020)

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.