Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/20406
Title: A Lagrangian heuristic for the capacitated plant location problem with side constraints
Authors: Sridharan, R.
Keywords: Lagrangian Heuristic;Capacitated Plant;Vehicle Routing Problem;Plant;Warehouse
Issue Date: 1-Sep-1989
Publisher: Indian Institute of Management Ahmedabad
Series/Report no.: W. P.;No. 824
Abstract: In this paper we present a Lagrangian relaxation approach for solving the capacitated plant location problem with side constraints. The side constraints are upper bound constraints on disjoint subsets of the (0-1) variables. We also provides on application where this procedure can be used to solve a particular vehicle routing problem. Computational results are provided for some problems both on the main frames computer as well as the personal computer.
URI: http://hdl.handle.net/11718/20406
Appears in Collections:Working Papers

Files in This Item:
File Description SizeFormat 
WP_1989_9_824.pdfWP_1989_9_824336.43 kBAdobe PDFView/Open


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