An Algorithm for M Asymmetric Travelling Salesman Problem on a Bandwidth-Limited Graph
Dragoš Cvetković; Milan Milosavljević; Vladimir Dimitrijević
The Yugoslav Journal of Operations Research (1991)
- Volume: 1, Issue: 1, page 15-25
- ISSN: 0354-0243
Access Full Article
top
How to cite
topDragoš Cvetković, Milan Milosavljević, and Vladimir Dimitrijević. "An Algorithm for M Asymmetric Travelling Salesman Problem on a Bandwidth-Limited Graph." The Yugoslav Journal of Operations Research 1.1 (1991): 15-25. <http://eudml.org/doc/261549>.
@article{DragošCvetković1991,
author = {Dragoš Cvetković, Milan Milosavljević, Vladimir Dimitrijević},
journal = {The Yugoslav Journal of Operations Research},
keywords = {polynomial dynamic programming; travelling salesman; directed bandwidth- limited graph},
language = {eng},
number = {1},
pages = {15-25},
publisher = {Faculty of Organizational Sciences},
title = {An Algorithm for M Asymmetric Travelling Salesman Problem on a Bandwidth-Limited Graph},
url = {http://eudml.org/doc/261549},
volume = {1},
year = {1991},
}
TY - JOUR
AU - Dragoš Cvetković
AU - Milan Milosavljević
AU - Vladimir Dimitrijević
TI - An Algorithm for M Asymmetric Travelling Salesman Problem on a Bandwidth-Limited Graph
JO - The Yugoslav Journal of Operations Research
PY - 1991
PB - Faculty of Organizational Sciences
VL - 1
IS - 1
SP - 15
EP - 25
LA - eng
KW - polynomial dynamic programming; travelling salesman; directed bandwidth- limited graph
UR - http://eudml.org/doc/261549
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.