Suggested Topics within your search.
Suggested Topics within your search.
Building construction & materials
2
Computer science
2
0-1 knapsack problem
1
Budget control
1
Budgeted maximum coverage problem
1
Budgeted maximum coverage problems
1
Combinatorial optimization
1
Costs
1
Distributed systems
1
Effective variables
1
History of engineering and technology
1
Iterative methods
1
Local search
1
Local search (optimization)
1
Local search algorithm
1
Markov chain
1
Neighbor structures
1
Neighbour structure
1
Non negatives
1
QA75 Electronic computers. Computer science
1
Set cover problem
1
Set theory
1
Structural optimization
1
TA Engineering (General). Civil engineering (General)
1
TH Building construction
1
Technology: general issues
1
Variable depth
1
Variable depth local search
1
animal experiment
1
article
1
-
281“... performance and reduce total storage devices cost, we use the algorithm of the 0/1 knapsack problem...”
Get full text
Others -
282“... applied in many fields,0/1 knapsack problem, traveler problem(TSP) and function regression etc.In recent...”
Get full text
Others -
283“... is then approximated by the Exact k-item Knapsack Problem (E-kKP). An approximate algorithm proposed by Caprara et al...”
Get full text
Others -
284“... Knapsack Problem (RKP) and the Elliptic Curve Discrete Logarithm Problem (ECDLP) to provide user...”
Get full text
Others -
285by 許薰文“... knapsack problem. A heuristic is proposed for this NP-hard problem which combines the dominance properties...”
Published 2012
Get full text
Others -
286“... on the Knapsack Problem (KP) with Robust Optimization. In the last stage, we developed an algorithm for the Robust...”
Get full text
Others -
287by Husbands, Ryan R.“... required is determined by remodeling it as a binary Knapsack Problem (KP) and then extending to a Multiple...”
Published 2018
Get full text
-
288“... can be solved by either the partition problem or the exact k-item knapsack problem (E-kKP). Therefore...”
Get full text
Others -
289
-
290“... models apply mathematical descriptions of problems, including the Knapsack Problem, Traveling Salesman...”
Get full text
Article -
291“... of alternate solutions in appropriate time). One of these problems is knapsack problem which is considered one...”
Get full text
Article -
292“... utilization. The multidimensional bounded knapsack problem is introduced to divide channels, to which...”
Get full text
Article -
293“..., this problem will further reduce to a kind of continuous quadratic knapsack problem in the base station which...”
Get full text
Article -
294“... Bounded Knapsack Problem to generate cutting patterns, instead of the original lexicographic search...”
Get full text
Article -
295“... knapsack problem. Reduced problem is solved using bounded variable linear programs (BVLPs). We obtain...”
Get full text
Article -
296by Ozsayin, Burcu“..., single-dimensional multi-objective knapsack problem and multi-objective assignment problem are taken...”
Published 2009
Get full text
Others -
297“... is mapped to a multidimensional multiple-choice knapsack problem (MMKP). Since MMKP is NP-hard, a polynomial...”
Get full text
Article -
298“... the network, which is mapped to a multidimensional multiple-choice knapsack problem (MMKP). Since MMKP is NP...”
Get full text
Article -
299“.... Experiments on the 0/1 knapsack problem are conducted to show the effectiveness of our approaches. Though...”
Get full text
Others -
300“... Knapsack Problem (KP) algorithm; experimental results show that the algorithm is very fast and gives more...”
Get full text
Article