"Branch-cut-price algorithms for solving a class of search problems on ..."

Z. Caner Taskin, J. Cole Smith (2017)

> Home

Details and statistics

DOI: 10.1002/NET.21740

access: closed

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/TaskinS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/TaskinS17
Z. Caner Taskin, J. Cole Smith:
Branch-cut-price algorithms for solving a class of search problems on general graphs. Networks 70(1): 4-18 (2017)

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.