"An Exact Algorithm for the Close Enough Traveling Salesman Problem with ..."

Minh Hoàng Hà et al. (2012)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2018-10-30

- no documents available
- export record
  dblp key:
  - conf/icores/HaBLR12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icores/HaBLR12
Minh Hoàng Hà, Nathalie Bostel, André Langevin, Louis-Martin Rousseau:
An Exact Algorithm for the Close Enough Traveling Salesman Problem with Arc Covering Constraints. ICORES 2012: 233-238

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.