multiple knapsack problem with setupWe consider the multiple knapsack problem (KP) with setup (MKPS), which is an extension of the KP with setup (KPS). We propose a new solving approach denoted by LPAndDP‐VNS that combines linear programming (LP) relaxation and dynamic programming (DP) to...
E.Y.-H. Lin, "A dynamic programming approach to the miltiple-choice multi-period knapsack problem and the recursive APL2 code," w: Proc. of the 17th Triennal Conference on the International Federation of Operational Research Societies, 2005....
It uses a dynamic programming type approach to the 0/1 knapsack problem (in the bound or unbound form) for multiple knapsacks. In practice, one typically runs into this problem if one wants to distribute files of certain sizes to e.g. one or several USB-Sticks or CD-Roms: One is looki...
The multidimensional multiple-choice knapsack problem (MMKP) is an extension of the 0–1 knapsack problem. The core concept has been used to design efficient algorithms for the knapsack problem but the core has not been developed for the MMKP so far. In this paper, we develop an approximate ...
constraints. Thus, existing algorithms cannot be directly applied to the multi-task allocation problem. The multi-task allocation problem without deadline constraints can be considered as a multiple-choice knapsack problem with cardinality constraints. It is the integer programming problem that is ...
This study proposes a new cooperative approach to the Multiple-Choice Knapsack problem with Setup (MCKS) that effectively combines variable neighborhood search (VNS) with an integer programing (IP). Our approach, based on a local search technique with an
The MICA problem type fits a class of optimization problems known as capital budgeting problems, program selection or multidimensional knapsack problems. (=-=Ignizio 1972-=-) These types of problems involve the decision-maker choosing a subset of projects from a larger, finite set while maximizing...
The ultimate model is a linear mixed integer programming model which can be solved exactly by common commercial software packages like GAMS. However due to the NP-hard nature of the problem, the ultimate linear programming model could hardly be solved in large cases. So developing an appropriate...
Shtub V. Levit (1997) DGAP–The dynamic generalized assignment problem Annals of Operations Research 69 227–239 10.1023/A:1018933012422 0880.90076 Article MATH Google Scholar S. Martello P. Toth (1977) An upper bound for the zero–one Knapsack problem and branch and bound Algorithm European...
Sensor selection in distributed multiple-radar architectures for localization: A knapsack problem formulation IEEE Trans Signal Process, 60 (1) (2012), pp. 247-260 View in ScopusGoogle Scholar 14 H. Godrich, A.P. Petropulu, H.V. Poor Power allocation strategies for target localization in distr...