Multidimensional Knapsack Problem (MKP)
Bee Colony Algorithm for the Multidimensional Knapsack Problem
... the Multidimensional Knapsack Problem (MKP), the goal of which is to find a subset of objects that maximizes a given objective function while satisfying some resource ...
5
The Minmax Multidimensional Knapsack Problem with Application to a Chance Constrained Problem
... one-dimensional MKP is related to the min knapsack problem [1], where one looks for a subset of items such that the sum of their weights exceeds a given constant, and the sum of their values is ...
11
An OR practitioner’s solution approach to the multidimensional knapsack problem Pages 73-82 Download PDF
... 0-1 Multidimensional Knapsack Problem (MKP) is an NP-Hard problem that has many important applications in business and ...large problem instances that can be time consuming to ...
10
A case study of controlling crossover in a selection hyper heuristic framework using the multidimensional knapsack problem
... the problem domain level, the question of which level should be respon- sible for managing the arguments required for crossover operators is an open research ...The multidimensional knapsack ...
31
The 0/1 Multidimensional Knapsack Problem and Its Variants: A Survey of Practical Models and Heuristic Approaches
... initial problem is decomposed on several sub-problems associated with a coordinator agent and each sub-problem is assigned to an agent with a part of available re- ...proposed problem as a ...
45
A Weight Coded Evolutionary Algorithm for the Multidimensional Knapsack Problem
... of MKP is selecting projects to ...budgeting problem [2], allocating processors and databases in a distributed computer system [3], project selection and cargo loading [4], and cutting stock prob- lems [5] ...
17
Local and global lifted cover inequalities for the multidimensional knapsack problem
... In most instances of the 0–1 MKP, however, the constraint matrix A is dense. In this situation, we cannot expect that valid inequalities derived from individual rows will always be useful, and it seems more ...
13
HYBRID OPTIMIZATION FOR GRID SCHEDULING USING GENETIC ALGORITHM WITH LOCAL SEARCH
... algorithm. Multidimensional knapsack problem 0-1 (MKP 0-1) will be used as test ...solve MKP 0-1, GPSOGA divided into 3 variants: GPSOGA (1), GPSOGA (2), and GPSOGA (3) based on ...
8
A genetic programming hyper heuristic for the multidimensional knapsack problem
... at al. [20] and generalised by Burke et al. [6] to include one, two and three dimensional bin packing problems, again obtaining human competitive results. A similar method was presented by Burke et al. [21] for two ...
5
Neural, Genetic, And Neurogenetic Approaches For Solving The 0-1 Multidimensional Knapsack Problem
... In this paper we addressed the multi-dimensional knapsack problem (MDKP). We proposed and tested several new methods and ideas for solving the MDKP. First we proposed better stopping criterion for the well- ...
12
Vol 3, No 10 (2015)
... of multidimensional knapsack problems. The general KP problem is well-known to be ...the knapsack with cardinality constraint. This study the practical problem of distributed filtering ...
6
Using Surrogate Information to Solve Multidimensional Multi choice Knapsack Problem
... standard knapsack problems such as the multiple-choice knap- sack problem [12][13] and the multidimensional knapsack prob- lem ...multiple-choice knapsack problem (MCKP), a ...
7
Mitogen-activated protein kinase phosphatase-2 deletion impairs synaptic plasticity and hippocampal-dependent memory
... hippocampal MKP-2 ⫺/⫺ cul- tures was seen that could account for the increased sEPSC ...for MKP-2 in inhibitory ...in MKP-2 ⫺/⫺ ...in MKP-2 ⫺ / ⫺ ...
7
Big Data Flow Adjustment Using Knapsack Problem
... choose a subset of these items aiming to maximize their overall value, while their overall weight does not exceed a given capacity c . Without loss of generality, it should be assumed that all values and weights are ...
10
Text Summarization Model based on Redundancy Constrained Knapsack Problem
... coverage problem (Filatova and Hatzivassiloglou, 2004; Yih et ...coverage problem, generates a summary by selecting sentences to cover as many information units (such as unigrams and bigrams) as ...coverage ...
10
Multidimensional subset sum problem
... h" h" CPUDEFS; /***************************************** VARIABLES: rmatrix bstar: holds the basis rmatrix mu: holds the imatrix b: BB: rvector mu of orthogonal holds original BB[j] hol[r] ...
54
AFRICAN BUFFALO OPTIMIZATION AND THE RANDOM IZED INSERTION ALGORITHM FOR THE ASYMMETRIC TRAVELLING SALESMANS PROBLEMS
... the problem of mobility of human resources under constraints [1-3] is organized as follows: First we present an approach to optimize the recruitment of ...The problem is NP hard and ...
6
Single Document Summarization as a Tree Knapsack Problem
... This paper proposed rules for transforming an RST- DT to a DEP-DT to obtain the parent-child relation- ships between EDUs. We treated a single document summarization method as a Tree Knapsack Problem, i.e. ...
6
Genetic Algorithms Based Approach to Solve 0-1 Knapsack Problem Optimization Problem
... 0-1 knapsack problem using the Genetic ...the knapsack problem, and implementation of two function roulette-wheel function and selection function for solving the ...the0-1 knapsack ...
8
An Algorithm of 0 1 Knapsack Problem Based on Economic Model
... (a) Greedy algorithm is very good and can attain the optimal solution in solving the local problem. These first n/2 objects are loaded into backpack in advance, if the total weight of n/2 objects is beyond M, ...
5