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


(1,k)-configuration facets for the generalized assignment problem
Authors:Elsie Sterbin Gottlieb  M R Rao
Institution:(1) Baruch College, The City University of New York, NY, USA;(2) Stern School of Business, New York University, NY, USA
Abstract:class of facet defining inequalities for the generalized assignment problem is derived. These inequalities are based upon multiple knapsack constraints and are derived from (1,k)-configuration inequalities.Partial financial support under NSF grant #CCR-8812736.Partial financial support under NSF grant #DMS-8606188.
Keywords:Generalized assignment problem  knapsack problem  special ordered sets  integer polytope  facets  (1  k)-configurations
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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