منابع مشابه
The Multiple-choice Knapsack Problem
This paper treats the multiple-choice (continuous) knapsack problem P: n mi n mi maximize L .L cijxijsubjectto(l) I I aij x ij";b,(2)0,,;xij";1,i=I,2, i=l J=l i=l J=1 ... , n, j = 1,2, .... mi and (3) at most one of x il, x i2' ... , x im. is positive for i = 1,2, ., ., n, , where n, mi are positive integers and aij' Cij' bare nonnegative real numbers. Two approximate algorithms and an exact br...
متن کاملAn Algorithm for the Penalized Multiple Choice Knapsack Problem
We present an algorithm for the penalized multiple choice knapsack problem (PMCKP), a combination of the more common penalized knapsack problem (PKP) and multiple choice knapsack problem (MCKP). Our approach is to converts a PMCKP into a PKP using a previously known transformation between MCKP and KP, and then solve the PKP greedily. For PMCKPs with well-behaved penalty functions, our algorithm...
متن کاملHeuristics for multiple knapsack problem
The Multiple Knapsack problem (MKP) is a hard combinatorial optimization problem with large application, which embraces many practical problems from different domains, like cargo loading, cutting stock, bin-packing, financial and other management, etc. It also arise as a subproblem in several more complex problems like vehicle routing problem and the algorithms to solve these problems will bene...
متن کاملThe Multiple Knapsack Problem With Color ConstraintsMilind
LIMITED DISTRIBUTION NOTICE This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and spe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1978
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.21.59