slugCost Estimation of Dynamic Programming Algorithm For Solution of Graphical as well as Network Problems for minimum path

Journal Title: International Journal of Management, IT and Engineering - Year 2012, Vol 2, Issue 3

Abstract

The cost estimation for any algorithm defines the running time for that algorithm means to say how much time it taken to produce the solution. It defines the performance of algorithm. The dynamic programming approach is a problem solving technique that solves problems by dividing them into sub problems. Dynamic programming is used when the sub problems are not independent e.g. when the share the same sub problems. Multistage decision policy with recursive approach will provides a well-organized way while using Dynamic programming. In multistage decision process the problem is divided into several parts called as sub problems and then each sub problem will be solved individually and the final result will be obtained by combining the results of all the sub problems. With the help of asymptotic notations, calculate the running time complexity of dynamic programming method for solution of graphical as well as network problems for the minimum path between nodes.

Authors and Affiliations

Anand Kumar Dixit, Manish Jain, Adarsh Srivastava and Ashish Misra

Keywords

Related Articles

Rise and Evolution of Mobile Wallets in India

There are 60 million consumers in this country that are under banked. They wait in lines to cash checks and to pay bills, it‟s highly inconvenient. A product like Mobile Wallets saves them a lot of time and inconvenien...

Impact of Visual Merchandising on Consumers’ Buying ChoiCe with referenCe to Reliance Fresh

The importance of visual merchandising cannot be ignored in this era where many purchase decisions are influenced by displays and presentations in store. The main objective of this paper is to study the influence of vi...

SOCIAL ENTREPRENEURSHIP: RESURGENCE AND INNOVATION OF ENTREPRENEURSHIP

Traditionally, entrepreneurship has been associated with profit making individuals who aim high and achieve a lot for themselves in the world of tough competition. But, with the empowerment and responsiveness of the ci...

Impact of fII’s on IndIan Stock Market (specific to SENSEX)

In the changing global scenario the impact of foreign institutional investors on Indian stock market is very high and its effects need to be studied. They have emerged as very significant players in the Indian stock ma...

ADAPTIVE PRICE EXPECTATIONS AND THE MODELLING OF WORLD GOLD PRICE DYNAMICS

Market models that incorporate inventories without including expectation factors assume that all inventories are unintended. This assumption is not true in mineral commodity markets where hedging and speculation are ri...

Download PDF file
  • EP ID EP18211
  • DOI -
  • Views 327
  • Downloads 10

How To Cite

Anand Kumar Dixit, Manish Jain, Adarsh Srivastava and Ashish Misra (2012). slugCost Estimation of Dynamic Programming Algorithm For Solution of Graphical as well as Network Problems for minimum path. International Journal of Management, IT and Engineering, 2(3), -. https://europub.co.uk./articles/-A-18211