New complexity results for time-constrained dynamical optimal path problems

First Page		Document Content
Date: 2010-02-01 11:59:55 Operations research Network flow Mathematical optimization Maximum flow problem Shortest path problem Optimal control Flow network Graph Dynamic programming Mathematics Graph theory Theoretical computer science		New complexity results for time-constrained dynamical optimal path problems Add to Reading List Source URL: www.emis.ams.org Download Document from Source Website File Size: 312,37 KB Share Document on Facebook

	Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook DocID: 1xVkB - View Document
	PDF Document DocID: 1xkJU - View Document
	Graph theory Po-Shen Loh June DocID: 1vmTo - View Document
	Graph theory Po-Shen Loh June DocID: 1vhpu - View Document
	Graph theory Po-Shen Loh June DocID: 1v8nl - View Document