"Heuristics for Solving Three Routing Problems: Close-Enough Traveling ..."

William Mennell (2009)

> Home

Details and statistics

DOI: —

access: closed

type: Book or Thesis

metadata version: 2022-05-04

- view
  - electronic edition via handle.net
  authority control:
- export record
  dblp key:
  - phd/basesearch/Mennell09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/basesearch/Mennell09
William Mennell:
Heuristics for Solving Three Routing Problems: Close-Enough Traveling Salesman Problem, Close-Enough Vehicle Routing Problem, Sequence-Dependent Team Orienteering Problem. University of Maryland, College Park, MD, USA, 2009

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.