In my economics research I am using a shortest path algorithm (see Shortest path from one source which goes through N edges). However, the algorithm works only for few number of nodes and edges, and when I extend the number of nodes and edges (which represents respectively the state of the economy and the cost of a decision) I am limited because of the running time of the simulations. Is there a way to reduce some how these running time by reducing the dimension of the state space for instance ?

  • What algorithm exactly? What exactly is the problem statement? What do you mean by state space? How is this question different from your existing one? (stackoverflow.com/q/51099146/781723) – D.W. Sep 15 at 7:30

Your Answer

 
discard

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Browse other questions tagged or ask your own question.