A branch and bound approach for the capacitated plant location problem using cuts from the partial convex hull

Barceló Bugeda, Jaime

dc.contributor.author	Barceló Bugeda, Jaime
dc.contributor.other	Facultat d'Informàtica de Barcelona
dc.date.accessioned	2017-11-22T17:57:48Z
dc.date.available	2017-11-22T17:57:48Z
dc.date.issued	1984
dc.identifier.citation	Barcelo, J. "A branch and bound approach for the capacitated plant location problem using cuts from the partial convex hull". 1984.
dc.identifier.uri	http://hdl.handle.net/2117/111090
dc.description.abstract	The efficient solution of capacitated plant location problems usually requires the development of specific software mainly when the problems are pure integer ones, standard mathematical programming codes being highly inefficient. The normal formulation of these problems includes different kinds of constraints which are of knapsack type. This fact can be used in connection with the procedures developped by Balas, Padberg and others, of computing facets of the knapsack polytopes. Procedures which can be used with a standard mathematical programming code are described and computational experience is reported.
dc.format.extent	35 p.
dc.language.iso	eng
dc.relation.ispartofseries	RR 84/06
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa
dc.subject.lcsh	Operations research
dc.subject.lcsh	Resource allocation
dc.title	A branch and bound approach for the capacitated plant location problem using cuts from the partial convex hull
dc.type	External research report
dc.subject.lemac	Investigació operativa
dc.subject.lemac	Assignació de recursos
dc.contributor.group	Universitat Politècnica de Catalunya. MPI - Modelització i Processament de la Informació
dc.rights.access	Open Access
drac.iddocument	21624708
dc.description.version	Postprint (published version)
upcommons.citation.author	Barcelo, J.
upcommons.citation.published	true