Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Journal Article
%1 journals/informs/IrnichV06
%A Irnich, Stefan
%A Villeneuve, Daniel
%D 2006
%J INFORMS J. Comput.
%K dblp
%N 3
%P 391-406
%T The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k 3.
%U http://dblp.uni-trier.de/db/journals/informs/informs18.html#IrnichV06
%V 18
@article{journals/informs/IrnichV06,
added-at = {2020-03-15T00:00:00.000+0100},
author = {Irnich, Stefan and Villeneuve, Daniel},
biburl = {https://www.bibsonomy.org/bibtex/2591870785fa882041d2785a79ded6fd8/dblp},
ee = {https://doi.org/10.1287/ijoc.1040.0117},
interhash = {d053227b909daeb0c56e279f552b9b52},
intrahash = {591870785fa882041d2785a79ded6fd8},
journal = {INFORMS J. Comput.},
keywords = {dblp},
number = 3,
pages = {391-406},
timestamp = {2020-03-17T11:38:16.000+0100},
title = {The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k 3.},
url = {http://dblp.uni-trier.de/db/journals/informs/informs18.html#IrnichV06},
volume = 18,
year = 2006
}