Show simple item record

Article

dc.creatorBoland, Natashiaes
dc.creatorDomínguez Marín, Patriciaes
dc.creatorNickel, Stefanes
dc.creatorPuerto Albandoz, Justoes
dc.date.accessioned2016-10-13T11:39:02Z
dc.date.available2016-10-13T11:39:02Z
dc.date.issued2006-11
dc.identifier.citationBoland, N., Domínguez Marín, P., Nickel, S. y Puerto Albandoz, J. (2006). Exact procedures for solving the discrete ordered median problem. Computers and Operations Research, 33 (11), 3270-3300.
dc.identifier.issn0305-0548es
dc.identifier.issn1873-765Xes
dc.identifier.urihttp://hdl.handle.net/11441/47455
dc.description.abstractThe Discrete Ordered Median Problem (DOMP) generalizes classical discrete location problems, such as the N-median, N-center and Uncapacitated Facility Location problems. It was introduced by Nickel [S. Nickel. Discrete Ordered Weber problems. In B. Fleischmann, R. Lasch, U. Derigs, W. Domschke, and U. Rieder, editors, Operations Research Proceedings 2000, pages 71–76. Springer, 2001], who formulated it as both a nonlinear and a linear integer program. We propose an alternative integer linear programming formulation for the DOMP, discuss relationships between both integer linear programming formulations, and show how properties of optimal solutions can be used to strengthen these formulations. Moreover, we present a specific branch and bound procedure to solve the DOMP more efficiently. We test the integer linear programming formulations and this branch and bound method computationally on randomly generated test problems.es
dc.description.sponsorshipMinisterio de Ciencia y Tecnologíaes
dc.formatapplication/pdfes
dc.language.isoenges
dc.publisherElsevieres
dc.relation.ispartofComputers and Operations Research, 33 (11), 3270-3300.
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectDiscrete locationes
dc.subjectInteger programminges
dc.titleExact procedures for solving the discrete ordered median problemes
dc.typeinfo:eu-repo/semantics/articlees
dcterms.identifierhttps://ror.org/03yxnpp24
dc.type.versioninfo:eu-repo/semantics/submittedVersiones
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses
dc.contributor.affiliationUniversidad de Sevilla. Departamento de Estadística e Investigación Operativaes
dc.relation.projectIDBFM01-2378es
dc.relation.projectIDHA2003:0121es
dc.relation.projectIDMTM04-0909es
dc.relation.publisherversionhttp://ac.els-cdn.com/S0305054805001206/1-s2.0-S0305054805001206-main.pdf?_tid=0c26af7a-9139-11e6-8dde-00000aacb35f&acdnat=1476358668_898577e84e1ececc4f67e3b8f6c8125fes
dc.identifier.doi10.1016/j.cor.2005.03.025es
dc.contributor.groupUniversidad de Sevilla. FQM331: Metodos y Modelos de la Estadistica y la Investigacion Operativaes
idus.format.extent41 p.es
dc.journaltitleComputers and Operations Researches
dc.publication.volumen33es
dc.publication.issue11es
dc.publication.initialPage3270es
dc.publication.endPage3300es
dc.identifier.idushttps://idus.us.es/xmlui/handle/11441/47455
dc.contributor.funderMinisterio de Ciencia y Tecnología (MCYT). España

FilesSizeFormatViewDescription
Exact procedures for solving the ...302.4KbIcon   [PDF] View/Open  

This item appears in the following collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Except where otherwise noted, this item's license is described as: Attribution-NonCommercial-NoDerivatives 4.0 Internacional