"A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem."

Walton Pereira Coutinho et al. (2016)

> Home

Details and statistics

DOI: 10.1287/IJOC.2016.0711

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/informs/CoutinhoNPS16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/informs/CoutinhoNPS16
Walton Pereira Coutinho, Roberto Quirino do Nascimento, Artur Alves Pessoa, Anand Subramanian:
A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem. INFORMS J. Comput. 28(4): 752-765 (2016)

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.