"Results for the close-enough traveling salesman problem with a ..."

Wenda Zhang, Jason J. Sauppe, Sheldon H. Jacobson (2023)

> Home

Details and statistics

DOI: 10.1007/S10589-023-00474-3

access: closed

type: Journal Article

metadata version: 2023-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/coap/ZhangSJ23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/coap/ZhangSJ23
Wenda Zhang, Jason J. Sauppe, Sheldon H. Jacobson:
Results for the close-enough traveling salesman problem with a branch-and-bound algorithm. Comput. Optim. Appl. 85(2): 369-407 (2023)

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.