"A branch-and-cut algorithm for the target visitation problem."

Achim Hildenbrandt (2019)

> Home

Details and statistics

DOI: 10.1007/S13675-019-00111-X

access: closed

type: Journal Article

metadata version: 2020-05-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ejco/Hildenbrandt19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejco/Hildenbrandt19
Achim Hildenbrandt:
A branch-and-cut algorithm for the target visitation problem. EURO J. Comput. Optim. 7(3): 209-242 (2019)

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.