Some Studies in Exact and Approximation Algorithms for Tree Search Problems

Please use this identifier to cite or link to this item: http://www.idr.iitkgp.ac.in/xmlui/handle/123456789/5207

Full metadata record

DC Field	Value	Language
dc.contributor.author	Sarkar, Uttam Kumar	-
dc.date.accessioned	2015-10-12T07:30:49Z	-
dc.date.available	2015-10-12T07:30:49Z	-
dc.date.issued	1992-09	-
dc.identifier.govdoc	NB11743	-
dc.identifier.uri	http://www.idr.iitkgp.ac.in/xmlui/handle/123456789/5207	-
dc.language.iso	en	en
dc.publisher	IIT Kharagpur	en
dc.subject	Greedy Algorithm	en
dc.subject	Dynamic Programming	en
dc.subject	Traveling Salesman Problem	en
dc.subject	Heuristic Search	en
dc.subject	Operations Research	en
dc.subject	Artificial Intelligence	en
dc.subject	Mathematics	en
dc.subject	Combinatorial Optimization Problem	en
dc.subject	Dynamic Programming	en
dc.title	Some Studies in Exact and Approximation Algorithms for Tree Search Problems	en
dc.type	Thesis	en
Appears in Collections:	Some Studies in Exact and Approximation Algorithms for Tree Search Problems

Files in This Item:

File	Description	Size	Format
NB11743_Abstract.pdf		189.82 kB	Adobe PDF	View/Open
NB11743_Thesis.pdf Restricted Access		6.05 MB	Adobe PDF	View/Open Request a copy

DSpace JSPUI