Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/6385
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sridharan, R. | - |
dc.date.accessioned | 2010-07-27T09:16:06Z | - |
dc.date.available | 2010-07-27T09:16:06Z | - |
dc.date.copyright | 1989-05 | - |
dc.date.issued | 2010-07-27T09:16:06Z | - |
dc.identifier.uri | http://hdl.handle.net/11718/6385 | - |
dc.description.abstract | In this note we show that the worst case solutions of the weak linear programming relaxation, the DRDP heuristic and the ADD heauristic for the Capacitated Plant Problem are not good. | en |
dc.language.iso | en | en |
dc.relation.ispartofseries | WP;1989/802 | - |
dc.subject | Location Problems | en |
dc.subject | Linear Programming | en |
dc.title | Capacitated plant location problem some worst case analysis | en |
dc.type | Working Paper | en |
Appears in Collections: | Working Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
WP 1989_802.pdf | 222.5 kB | Adobe PDF | View/Open |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.