Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/networks/TaskinS17
%A Taskin, Z. Caner
%A Smith, J. Cole
%D 2017
%J Networks
%K dblp
%N 1
%P 4-18
%T Branch-cut-price algorithms for solving a class of search problems on general graphs.
%U http://dblp.uni-trier.de/db/journals/networks/networks70.html#TaskinS17
%V 70
@article{journals/networks/TaskinS17,
added-at = {2021-10-14T00:00:00.000+0200},
author = {Taskin, Z. Caner and Smith, J. Cole},
biburl = {https://www.bibsonomy.org/bibtex/2cefcb9c7157c70b701078d7eeb59c4cb/dblp},
ee = {https://doi.org/10.1002/net.21740},
interhash = {782522164a4eedfd9e7b383a6a2f7679},
intrahash = {cefcb9c7157c70b701078d7eeb59c4cb},
journal = {Networks},
keywords = {dblp},
number = 1,
pages = {4-18},
timestamp = {2024-04-09T05:40:22.000+0200},
title = {Branch-cut-price algorithms for solving a class of search problems on general graphs.},
url = {http://dblp.uni-trier.de/db/journals/networks/networks70.html#TaskinS17},
volume = 70,
year = 2017
}