DSpace
 

EPrints@IIT Delhi >
Electronic Theses and Dissertations >
Computer Science and Engineering -ETD >

Please use this identifier to cite or link to this item: http://eprint.iitd.ac.in/handle/2074/2219

Full metadata record

DC FieldValueLanguage
dc.contributor.advisorGarg, Naveen-
dc.contributor.authorKhandekar, Rohit-
dc.date.accessioned2006-10-09T04:41:46Z-
dc.date.available2006-10-09T04:41:46Z-
dc.date.issued2004-
dc.identifier.urihttp://eprint.iitd.ac.in/dspace/handle/2074/2219-
dc.description.abstractAbstract/summary available in content.pdfen
dc.format.extent116223 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoenen
dc.subjectAlgorithmsen
dc.subjectConvex programmingen
dc.titleLagrangian relaxation based algorithms for convex programming problemsen
dc.typeThesisen
dc.thesis.degreenamePh.D.en
dc.thesis.degreelevelDoctoralen
dc.thesis.degreegrantorIndian Institute of Technology Delhien
Appears in Collections:Computer Science and Engineering -ETD

Files in This Item:

File Description SizeFormat
content.pdf113.5 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback