Show simple item record

dc.creatorM. Angélica Salazar-Aguilar
dc.creatorJ. Luis González-Velarde
dc.creatorRoger Z. Ríos-Mercado
dc.date2012
dc.date.accessioned2019-10-08T20:36:00Z
dc.date.available2019-10-08T20:36:00Z
dc.identifierhttp://www.redalyc.org/articulo.oa?id=61524403006
dc.identifier.urihttp://hdl.handle.net/11285/635187
dc.descriptionA new heuristic procedure for a commercial territory design problem is introduced in this work. The proposed procedure is based on the divide-and-conquer paradigm and basically consists of a successive dichotomy process on a given large instance of the problem. During this process, a series of integer quadratic subproblems is solved. The obtained computational results have shown that the proposed heuristic is an attractive technique for obtaining locally optimal solutions for large instances which are intractable by using exact optimization methods.
dc.formatapplication/pdf
dc.languageen
dc.publisherInstituto Politécnico Nacional
dc.relationhttp://www.redalyc.org/revista.oa?id=615
dc.rightsComputación y Sistemas
dc.sourceComputación y Sistemas (México) Num.3 Vol.16
dc.subjectComputación
dc.subjectTerritory design
dc.subjectheuristic optimization
dc.subjectinteger quadratic programming
dc.subjectdivide and-conquer approach
dc.titleA Divide-and-Conquer Approach to Commercial Territory Design
dc.typeArtículo científico


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Redalyc 1391
    Red de Revistas Científicas de América Latina y el Caribe, España y Portugal

Show simple item record