Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/6385
Title: Capacitated plant location problem some worst case analysis
Authors: Sridharan, R.
Keywords: Location Problems;Linear Programming
Issue Date: 27-Jul-2010
Series/Report no.: WP;1989/802
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.
URI: http://hdl.handle.net/11718/6385
Appears in Collections:Working Papers

Files in This Item:
File Description SizeFormat 
WP 1989_802.pdf222.5 kBAdobe PDFView/Open


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.