DOIONLINE 
DOIONLINE Publish In |
International Journal of Advance Computational Engineering and Networking (IJACEN)-IJACEN |
 Journal Home Volume Issue |
||||||||
Issue |
Volume-5, Issue-1 ( Jan, 2017 ) | |||||||||
Paper Title |
A Complex Problem of Knapsack and Shortest Paths on Weighted Graphs | |||||||||
Author Name |
Nadav Voloch, Yair Zadok | |||||||||
Affilition |
Dan school of high-tech studies, The center for academic studies, Or-Yehuda, Israel | |||||||||
Pages |
31-34 | |||||||||
Abstract |
there are two problems in computer science algorithms, the knapsack problem and the shortest paths on weighted graphs problem, that are well-known and researched in the past decades. A complex problem that combines these two, as a two-step problem on the same entities, is the main idea and subject of this paper, in which this combination will be presented, along with several examples for it. Index terms- Knapsack problem, Shortest paths on weighted graphs, Dijkstra's algorithm, Dantzig greedy approximation algoriths, graph theory. | |||||||||
| View Paper | ||||||||||
