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

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 c...

ver descrição completa

Detalhes bibliográficos
Autor: Barceló Bugeda, Jaime|||0000-0001-6195-6434
Formato: informe técnico
Fecha de publicación:1984
País:España
Recursos:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/111090
Acesso em linha:https://hdl.handle.net/2117/111090
Access Level:acceso abierto
Palavra-chave:Operations research
Resource allocation
Investigació operativa
Assignació de recursos
Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa
id ES_2e589faa0c8d0365e79ff2c809052f14
oai_identifier_str oai:upcommons.upc.edu:2117/111090
network_acronym_str ES
network_name_str España
repository_id_str
spelling A branch and bound approach for the capacitated plant location problem using cuts from the partial convex hullBarceló Bugeda, Jaime|||0000-0001-6195-6434Operations researchResource allocationInvestigació operativaAssignació de recursosÀrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativaThe 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.19841984-01-0120172017-11-22reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/pdfhttps://hdl.handle.net/2117/111090reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2http://creativecommons.org/licenses/by-nc-nd/3.0/es/info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/1110902026-05-27T15:37:01Z
dc.title.none.fl_str_mv A branch and bound approach for the capacitated plant location problem using cuts from the partial convex hull
title A branch and bound approach for the capacitated plant location problem using cuts from the partial convex hull
spellingShingle A branch and bound approach for the capacitated plant location problem using cuts from the partial convex hull
Barceló Bugeda, Jaime|||0000-0001-6195-6434
Operations research
Resource allocation
Investigació operativa
Assignació de recursos
Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa
title_short A branch and bound approach for the capacitated plant location problem using cuts from the partial convex hull
title_full A branch and bound approach for the capacitated plant location problem using cuts from the partial convex hull
title_fullStr A branch and bound approach for the capacitated plant location problem using cuts from the partial convex hull
title_full_unstemmed A branch and bound approach for the capacitated plant location problem using cuts from the partial convex hull
title_sort A branch and bound approach for the capacitated plant location problem using cuts from the partial convex hull
dc.creator.none.fl_str_mv Barceló Bugeda, Jaime|||0000-0001-6195-6434
author Barceló Bugeda, Jaime|||0000-0001-6195-6434
author_facet Barceló Bugeda, Jaime|||0000-0001-6195-6434
author_role author
dc.subject.none.fl_str_mv Operations research
Resource allocation
Investigació operativa
Assignació de recursos
Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa
topic Operations research
Resource allocation
Investigació operativa
Assignació de recursos
Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa
description 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.
publishDate 1984
dc.date.none.fl_str_mv 1984
1984-01-01
2017
2017-11-22
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/111090
url https://hdl.handle.net/2117/111090
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2

http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2

http://creativecommons.org/licenses/by-nc-nd/3.0/es/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869405397928902656
score 15,300719

Registos relacionados