eprints
 

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

Files in This Item:

File Description SizeFormat
content.pdf113KbAdobe PDFView/Open

Show simple item record

All items in DSpace are protected by copyright, with all rights reserved.

 

eprints@IIT Delhi Copyright  © 2004-2005 Powered by DSpace Software  - Feedback