|
EPrints@IIT Delhi >
Electronic Theses and Dissertations >
Computer Science and Engineering -ETD >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/2074/2219
|
Full metadata record
| DC Field | Value | Language |
| contributor.advisor | Garg, Naveen | - |
| contributor.author | Khandekar, Rohit | - |
| date.accessioned | 2006-10-09T04:41:46Z | - |
| date.available | 2006-10-09T04:41:46Z | - |
| date.issued | 2004 | - |
| identifier.uri | http://eprint.iitd.ac.in/dspace/handle/2074/2219 | - |
| description.abstract | Abstract/summary available in content.pdf | en |
| format.extent | 116223 bytes | - |
| format.mimetype | application/pdf | - |
| language.iso | en | en |
| subject | Algorithms | en |
| subject | Convex programming | en |
| title | Lagrangian relaxation based algorithms for convex programming problems | en |
| type | Thesis | en |
| thesis.degreename | Ph.D. | en |
| thesis.degreelevel | Doctoral | en |
| thesis.degreegrantor | Indian Institute of Technology Delhi | en |
| Appears in Collections: | Computer Science and Engineering -ETD
|
Files in This Item:
| File |
Description |
Size | Format |
| content.pdf | | 113Kb | Adobe PDF | View/Open |
|
Show simple item record
All items in DSpace are protected by copyright, with all rights reserved.
|