International Journal of Advance Computational Engineering and Networking (IJACEN)
.
current issues
Volume-8,Issue-7  ( Jul, 2020 )
Past issues
  1. Volume-8,Issue-6  ( Jun, 2020 )
  2. Volume-8,Issue-5  ( May, 2020 )
  3. Volume-8,Issue-4  ( Apr, 2020 )
  4. Volume-8,Issue-3  ( Mar, 2020 )
  5. Volume-8,Issue-2  ( Feb, 2020 )
  6. Volume-8,Issue-1  ( Jan, 2020 )
  7. Volume-7,Issue-12  ( Dec, 2019 )
  8. Volume-7,Issue-11  ( Nov, 2019 )
  9. Volume-7, Issue-10  ( Oct, 2019 )
  10. Volume-7, Issue-9  ( Sep, 2019 )

Statistics report
Sep. 2020
Submitted Papers : 80
Accepted Papers : 10
Rejected Papers : 70
Acc. Perc : 12%
Issue Published : 90
Paper Published : 1248
No. of Authors : 3136
  Journal Paper

Paper Title
A Complex Problem of Knapsack and Shortest Paths on Weighted Graphs

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.


Author - Nadav Voloch, Yair Zadok

| PDF |
Viewed - 78
| Published on 2017-03-07
   
   
IRAJ Other Journals
IJACEN updates
Paper Submission is open now for upcoming Issue.
The Conference World

JOURNAL SUPPORTED BY