1. Home
  2. Knapsack problem
  Subject:

Knapsack problem   New Search

View on DBpedia    View on Wikipedia
Top related subjects:
RELATED SUBJECTS:
The publications listed also have these subjects
Algorithm  8 times
Mathematical optimization  4 times
Time complexity  2 times
Pareto efficiency  2 times
Integer programming  2 times
Classical mechanics  2 times
Spanning tree  1 time
Simulated annealing  1 time
NP-hardness  1 time
NP-completeness  1 time
Metaheuristic  1 time
K-means clustering  1 time
Herding  1 time
Graph theory  1 time
Evolutionary algorithm  1 time
Dynamic programming  1 time
Data mining  1 time
Combinatorial optimization  1 time
Cloud computing  1 time
Cardinality  1 time
Bayesian statistics  1 time
Analytic hierarchy process  1 time

Publications tagged with this subject: 13

Note: Top 50 publications shown only. Open an item panel to view more info (open all)


1. Knapsack with variable weights satisfying linear constraints

2. Impact of sensor-based change detection schemes on the performance of evolutionary dynamic optimization techniques

3. Finding representations for an unconstrained bi-objective combinatorial optimization problem

4. Continuous relaxation for discrete DC programming

5. Knapsack in Graph Groups

6. Hybrid multi-objective Bayesian estimation of distribution algorithm: a comparative analysis for the multi-objective knapsack problem

7. On nadir points of multiobjective integer programming problems

8. Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problem

9. Independent travel recommendation algorithm based on analytical hierarchy process and simulated annealing for professional tourist

10. A k-means binarization framework applied to multidimensional knapsack problem

11. A new surrogate placement algorithm for cloud-based content delivery networks

12. An Improved Binary Wolf Pack Algorithm Based on Adaptive Step Length and Improved Update Strategy for 0-1 Knapsack Problems

13. Spatial Cluster Detection Through a Dynamic Programming Approach


Questions?

Drop us a message.