"New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem."

Dino Ahr, Gerhard Reinelt (2002)

> Home

Details and statistics

DOI: 10.1007/3-540-45749-6_10

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/esa/AhrR02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/esa/AhrR02
Dino Ahr, Gerhard Reinelt:
New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem. ESA 2002: 64-74

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.