Submodular Integer Cover and Its Application to Production Planning

详细信息    查看全文

• 作者：Toshihiro Fujito ; Takatoshi Yabuta
• 刊名：Lecture Notes in Computer Science
• 出版年：2005
• 出版时间：2005
• 年：2005
• 卷：3351
• 期：1
• 全文大小：221 KB
• 刊物类别：Computer Science
• 刊物主题：Artificial Intelligence and Robotics
  Computer Communication Networks
  Software Engineering
  Data Encryption
  Database Management
  Computation by Abstract Devices
  Algorithm Analysis and Problem Complexity
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1611-3349

文摘

Suppose there are a set of suppliers i and a set of consumers j with demands b _j , and the amount of products that can be shipped from i to j is at most c _ij . The amount of products that a supplier i can produce is an integer multiple of its capacity κ _i , and every production of κ _i products incurs the cost of w _i . The capacitated supply-demand (CSD) problem is to minimize the production cost of ∑ _i w _i x _i such that all the demands (or the total demand requirement specified separately) at consumers are satisfied by shipping products from the suppliers to them.