Searching networks with unrestricted at costs

dc.contributor.author	Dasgupta, Partha Sarathi
dc.contributor.author	Sen, A K
dc.contributor.author	Nandy, Subhas C
dc.contributor.author	Bhattacharya, Bhargab B
dc.date.accessioned	2012-03-22T14:50:27Z
dc.date.available	2012-03-22T14:50:27Z
dc.date.issued	2001
dc.identifier.citation	IEEE transactions on systems,man and cybernetics,V31,P497-507	en_US
dc.identifier.uri	http://hdl.handle.net/10263/3349
dc.language.iso	en	en_US
dc.subject	Artificial intelligence	en_US
dc.subject	Heuristic search	en_US
dc.subject	Number partitioning	en_US
dc.subject	VLSI floor planning	en_US
dc.title	Searching networks with unrestricted at costs	en_US
dc.type	Article	en_US