Symmetric traveling salesman problem:some new insight
| dc.contributor.author | Usha, M | |
| dc.date.accessioned | 2012-05-01T14:34:44Z | |
| dc.date.available | 2012-05-01T14:34:44Z | |
| dc.date.issued | 1998 | |
| dc.description | This thesis is under supervision of Prof.T S Arthanari | en_US |
| dc.identifier.citation | 112p,iii | en_US |
| dc.identifier.uri | http://hdl.handle.net/10263/3637 | |
| dc.language.iso | en | en_US |
| dc.publisher | Indian Statistical Institute,Calcutta | en_US |
| dc.relation.ispartofseries | ISI Phd thesis;TH119 | |
| dc.subject | Graph theory | en_US |
| dc.subject | Traveling salesman problem | en_US |
| dc.subject | Linear programming | en_US |
| dc.subject | Polytopes | en_US |
| dc.subject | Combinatorial optimization | en_US |
| dc.title | Symmetric traveling salesman problem:some new insight | en_US |
| dc.type | Thesis | en_US |
