A Lagrangian heuristic for the capacitated plant location problem with side constraints

dc.contributor.author	Sridharan, R.
dc.date.accessioned	2018-02-27T11:24:13Z
dc.date.available	2018-02-27T11:24:13Z
dc.date.issued	1989-09-01
dc.identifier.uri	http://hdl.handle.net/11718/20406
dc.description.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.	en_US
dc.language.iso	en_US	en_US
dc.publisher	Indian Institute of Management Ahmedabad	en_US
dc.relation.ispartofseries	W. P.;No. 824
dc.subject	Lagrangian Heuristic	en_US
dc.subject	Capacitated Plant	en_US
dc.subject	Vehicle Routing Problem	en_US
dc.subject	Plant	en_US
dc.subject	Warehouse	en_US
dc.title	A Lagrangian heuristic for the capacitated plant location problem with side constraints	en_US
dc.type	Working Paper	en_US