首页 | 本学科首页   官方微博 | 高级检索  
     


On solving large instances of the capacitated facility location problem
Authors:Jayaram K. Sankaran
Affiliation:Department of Information Systems and Operations Management, The University of Auckland, Auckland, New Zealand
Abstract:We present two sets of results pertaining to the solution of capacitated facility location problems that are large, especially with regard to the number of customers. One set of results relates to customer aggregation, while another set of results concerns the judicious selection of variable-upper-bounding (VUB) constraints to include in the initial integer-programming formulation.
Keywords:Facilities planning and design   Customer aggregation   Integer programming   Polyhedral approaches   Variable-upper-bounds
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号